Probabilistic analysis of algorithms: What s it good for?

Size: px
Start display at page:

Download "Probabilistic analysis of algorithms: What s it good for?"

Transcription

1 Probabilistic analysis of algorithms: What s it good for? Conrado Martínez Univ. Politècnica de Catalunya, Spain February 2008

2 The goal Given some algorithm taking inputs from some set Á, we would like to analyze the performance of the algorithm as a function of the input size (and possibly other parameters).

3 Why should we analyze algorithms? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior

4 Why should we analyze algorithms? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior

5 Why should we analyze algorithms? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior

6 Why should we analyze algorithms? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior

7 Concepts & definitions The performance Á Æ depends on each particular instance of the input We have to introduce some notion of size: Á Æ; we may safely assume that each Á Ò Ü ¾ Á Ü Ò is finite Worst case: [worst] Òµ ÑÜ Üµ Ü ¾ Á Ò

8 To analyze typical behavior or the performance of randomized algorithms, we have to assume some probabilistic distribution on the input and/or the algorithm s choices; hence, we consider the performance as a family of random variables Ò Ò¼ ; Ò Á Ò Æ Average case: [avg] Òµ Ò ¼ È Ò

9 When we assume uniformly distributed inputs ÈÜ ½ Á Ò for all Ü ¾ Á Ò our problem is one of counting, e.g., È Ü¾ÁÒ Ò Üµ Á Ò

10 One of the most important tools in the analysis of algorithms are generating functions: Þ Ùµ Ò¼ ¼ È Ò Þ Ò Ù For the uniform distribution Þ Ò Ù Þ Ùµ Þ Ò Ù È Ò¼ ȼ È ÒÞ Ò Ù Þ Ò Ò¼ ÒÞ Ò ÞÒ Ù Þ Ùµ Þ Ò Þ ½µ with Ò Ü ¾ Á Ü Ò Üµ and Ò Á Ò

11 The equations before can be expressed symbolically Þ Ùµ ܾÁ Þ Ü Ù Üµ The ratio of the Ò th coefficients of Þ Ùµ and Þ ½µ is the probability generating function of Ò Ô Ò Ùµ ¼ È Ò Ù ÞÒ Þ Ùµ Þ Ò Þ ½µ

12 Taking derivatives w.r.t. Ù and setting Ù ½ we get the expected value, second factorial moment,... Öµ Þµ Ö Þ Ùµ Ù Ö Ò¼ Ù½ Ò Ö Þ Ò For example, Î Ò Ò ¾ Ò Ò ¾ Þ Ò ¾µ Þµ Þ Ò Þµ Þ Ò Þµµ ¾

13 The symbolic method The symbolic method translates combinatorial constructions to functional equations over generating functions. Example: Consider the counting generating function of a combinatorial class : If then Þµ «¾ Þ «Þµ Þµ Þµ Ò¼ µ¾ Ò Þ Ò Þ «¾ Þ «¼ ¾ ½ Þ ¼ ¾ Þ ½

14 A dictionary of (labelled) combinatorial constructions and G.F. s ËÕ µ ½ Þ ½ ½ ËØ µ ÜÔ µ ÝÐ µ ÐÓ ½ ½

15 Complex analysis Another important set of techniques comes from complex variable analysis. Under suitable technical conditions, if Þµ is analytic in a disk Þ ¾ Þ ½ and has a single dominant singularity at Þ ½ then Þµ Þµ µ Þ Ò Þµ Þ Ò Þµ This is one of the useful transfer lemmas of Flajolet and Odlyzko (1990). Many other similar results are extremely useful when computing asymptotic estimates for the Ò th coefficient of a generating function.

16 For example, if Þµ Þµ ½ Þ «À Þµ as Þ, the dominant singularity of Þµ, for some analytic Þµ and À Þµ and «¾ ½ ¾ then Þ Ò Þµ µ Ò Ò«½ «µ ½ Ç Ò ½ µ

17 Complex analysis In recent years, complex analysis techniques and perturbation theory have been used to prove powerful results such as Hwang s quasi power theorem, which allows one to prove the convergence in law to a Gaussian distribution of many combinatorial parameters in strings, permutations, trees, etc., as well as local limits and the speed of convergence.

18 A trivial example: Counting binary trees A binary tree is either an empty tree (leaf) or a root together with two binary (sub)trees: Hence the counting GF of binary trees is Þµ ½ Þ ¾ Þµ

19 Solving the equation before for Þµ and since ¼µ ¼ ½, Þµ ½ Ô ½ Þ ¾Þ ½ Þ ¼ Þ ¼ Extracting the Ò th coefficient of Þµ we find ¾Ò Ò Þ Ò Þµ Ò ½ Ò ¾ Ò Ô

20 2 nd example: The average cost of building BSTs A binary search tree Ì for a set of elements contains some Ý ¾ at its root; its subtrees Ä and Ê are binary search trees recursively constructed for the sets Ü ¾ Ü Ý and Þ ¾ Ý Þ. Binary search trees (BSTs) are useful for fast lookup, and support both dynamic insertions and deletions.

21 To insert some new item Û into a BST, we compare Û to the element Ý at the root of Ì. If Û Ý then we insert Û recursively in the left subtree of Ì. If Ý Û we insert recursively in the right subtree. If at any point we have to insert the element into an empty tree, we simply make Û the root of the new tree

22 How much does it cost to build a BST of size Ò? Let Ü Ì µ denote the depth (= edges from the root) of element Ü in Ì. It is the number of elements with which Ü was compared when we inserted it at some previous step. Hence, the cost Á Ì µ to build Ì is Á Ì µ Ü¾Ì Ü Ì µ Á Ì µ is also called the internal path length of Ì.

23 Let Ò Ì. If Ì is a linked list (at most one non empty subtree per node) then Á Ì µ Ò Ò ½µ¾. If Ì is perfectly balanced then Á Ì µ Ò ÐÓ Òµ.

24 In a random BST any element has the same probability of being its root; hence the probability that Ä is ½Ò for all, ¼ Ò. ÈÌ ½ ÈÄ ÈÊ Ì if Ì is empty, otherwise.

25 Á Ì µ ¼ Á ĵ Á ʵ Ì ½ if Ì is empty, otherwise.

26 Á Ò Þ Ò Á Þµ Á Þµ Ì ¾ ÈÌ Á Ì µþ Ì Äʵ¾ ÈÄ È Ê Á ĵ Á ʵ Ä ÊµÞÄ Ê ½ Ä Ê ½

27 Á Þ Äʵ¾ Äʵ¾ Äʵ¾ Äʵ¾ Äʵ¾ ÈÄ È Ê Á ĵ Á ʵ Ä ÊµÞ Ä Ê ÈÄ È Ê Á ÄµÞ Ä Ê ÈÄ È Ê Á ÊµÞ Ä Ê ÈÄ È Ê ÄÞ Ä Ê ÈÄ È Ê ÊÞ Ä Ê

28 Á Þ ¾ ¾ ¾ ¾ Ì ½Ì ¾µ¾ ÈÌ ½ Á Ì ½ µþ ̽ È Ì ¾ Þ Ì¾ ¼ Ì ½Ì ¾µ¾ ÈÌ ½ Ì ½ Þ Ì½ È Ì ¾ Þ Ì¾ ¼ Ì ½¾ Ì ½¾ ÈÌ ½ Á Ì ½ µþ ̽ ½ ¼ Ì ¾¾ ÈÌ ½ Ì ½ Þ Ì½ ½ ¼ Ì ¾¾ ÈÌ ¾ Þ Ì¾ ½ ÈÌ ¾ Þ Ì¾ ½

29 ÈÌ Þ Ì Ì ¾ Ò¼ Þ Ò ½ ½ Þ Ì ¾ ÈÌ Ì Þ Ì Ò¼ ÒÞ Ò Þ ½ Þ ½ Þ Þ ½ Þµ ¾

30 Á Þ ¾ Á Þµ ½ Þ ÐÒ Á Þµ ¾ Á ¼µ ¼ ½ ½ Þ ¾Þ ½ Þµ ¾Þ ½ Þµ ¾ ½ Þµ ¾

31 Á Ò Þ Ò Á Þµ ¾ Ò ½µÀ Ò ¾Ò ÐÒ Ò ¾Ò Ç ÐÓ Òµ À Ò ½Ò ½ ÐÒ Ò Ç Ò ½ µ

32 3 rd example: Insertion in à d trees

33 3 rd example: Insertion in à d trees 1 1

34 3 rd example: Insertion in à d trees

35 3 rd example: Insertion in à d trees

36 3 rd example: Insertion in à d trees

37 3 rd example: Insertion in à d trees

38 Insertion in relaxed à d trees ÖØ Ò ÖØ ÖØ Ø ÓÒ Ø ÐÑ ² Ü µ ß ÒØ Ò Þ Ø µ ÒØ Ù ÖÒÓÑ ¼ Ò µ Ù Ò µ ÖØÙÖÒ Ò ÖØØÖÓÓØ Ø Ü µ Ð ß»» Ø ÒÒÓØ ÑÔØÝ ÒØ Ø ¹ Ö Ü Ø ¹ Ý µ Ø ¹ ÐØ Ò ÖØ Ø ¹ ÐØ Ü µ Ð Ø ¹ ÖØ Ò ÖØ Ø ¹ ÖØ Ü µ ÖØÙÖÒ Ø Ð Ð

39 Deletion in relaxed à d trees ÖØ ÐØ ÖØ Ø ÓÒ Ø ÐÑ ² Ü µ ß Ø ÆÍÄÄ µ ÖØÙÖÒ ÆÍÄÄ Ø ¹ Ý Üµ ÖØÙÖÒ ÓÒ Ø ¹ ÐØ Ø ¹ ÖØ µ Ð ÒØ Ø ¹ Ö Ü ¹ Ý Ø ¹ Ý µ Ø ¹ ÐØ ÐØ Ø ¹ ÐØ Ü µ Ð Ø ¹ ÖØ ÐØ Ø ¹ ÖØ Ü µ ÖØÙÖÒ Ø

40 Split: Case #1 t r

41 Split: Case #1 t r

42 Split: Case #1 t r

43 Split: Case #2 t r

44 Split: Case #2 t r

45 Split: Case #2 t r

46 Split: Case #2 t r

47 Analysis of split/join Ò avg. number of visited nodes in a split Ñ Ò avg. number of visited nodes in a join Ò ½ ¾ ÒÃ Ã ½ Ã ¼Ò ¼Ò ½ Ò ½ ¾ Ã ½µ ÒÃ Ò Ñ ¼Ò where Ò is probability of joining two trees with total size.

48 Analysis of split/join Ò avg. number of visited nodes in a split Ñ Ò avg. number of visited nodes in a join Ò ½ ¾ ÒÃ Ã ½ Ã ¼Ò ¼Ò ½ Ò ½ ¾ Ã ½µ ÒÃ Ò Ñ ¼Ò where Ò is probability of joining two trees with total size.

49 Analysis of split/join Ò avg. number of visited nodes in a split Ñ Ò avg. number of visited nodes in a join Ò ½ ¾ ÒÃ Ã ½ Ã ¼Ò ¼Ò ½ Ò ½ ¾ Ã ½µ ÒÃ Ò Ñ ¼Ò where Ò is probability of joining two trees with total size.

50 The recurrence for Ò is Ò ½ ¾ ÒÃ with ¼ ¼. ¼Ò ¾ Ã ½µ ÒÃ ½ Ò ½ ¾ Ã ½µ ÒÃ ¼Ò Ò Ò ½ Ñ ¼Ò The recurrence for Ñ Ò has exactly the same shape with the rôles of Ò and Ñ Ò interchanged; it easily follows that Ò Ñ Ò.

51 Define Ë Þµ Ò¼ Ò Þ Ò The recurrence for Ò translates to Þ ¾ Ë Þ ¾ ¾ ½ ¾Þ ½ Þ Ë Þ Ã ¾ ¾ Ã Ë Þµ Þ ½ Þµ ¾ ¾ ½ Þµ with initial conditions Ë ¼µ ¼ and Ë ¼ ¼µ ½.

52 The homogeneous second order linear ODE is of hypergeometric type. An easy particular solution of the ODE is ½ Ã ½ ¾ Ã ½ ½ Þ

53 Theorem The generating function Ë Þµ of the expected cost of split is, for any à ¾, ½ ½ Ë Þµ ½ ¾ ½ ½ à where ««Ãµ ½ ¾ ½ Þµ «¾ ½ ½ «¾ «¾ Õ ½ ½ ½. Ã Þ ½ Þ

54 Theorem The expected cost Ò of splitting a relaxed à d tree of size Ò is Ò Ãµ Ò Ãµ Ó Òµ with ½ ¾ ½ ½ ½ à «½ ½ ¾ ¾«½µ ««µ ¼ ½ ½ à ½ ½

55 K Plot of õ

56 K Plot of õ

Designing Networks Incrementally

Designing Networks Incrementally Designing Networks Incrementally Adam Meyerson Kamesh Munagala Ý Serge Plotkin Þ Abstract We consider the problem of incrementally designing a network to route demand to a single sink on an underlying

More information

SFU CMPT Lecture: Week 9

SFU CMPT Lecture: Week 9 SFU CMPT-307 2008-2 1 Lecture: Week 9 SFU CMPT-307 2008-2 Lecture: Week 9 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on July 8, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 9 Binary search trees

More information

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0.

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0. Range: This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version.. isclaimer The shapes of the reference glyphs used in these code charts

More information

Scan Scheduling Specification and Analysis

Scan Scheduling Specification and Analysis Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract

More information

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.

More information

Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms

Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms Roni Khardon Tufts University Medford, MA 02155 roni@eecs.tufts.edu Dan Roth University of Illinois Urbana, IL 61801 danr@cs.uiuc.edu

More information

Database Languages and their Compilers

Database Languages and their Compilers Database Languages and their Compilers Prof. Dr. Torsten Grust Database Systems Research Group U Tübingen Winter 2010 2010 T. Grust Database Languages and their Compilers 4 Query Normalization Finally,

More information

SFU CMPT Lecture: Week 8

SFU CMPT Lecture: Week 8 SFU CMPT-307 2008-2 1 Lecture: Week 8 SFU CMPT-307 2008-2 Lecture: Week 8 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on June 24, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 8 Universal hashing

More information

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.

More information

Optimal Static Range Reporting in One Dimension

Optimal Static Range Reporting in One Dimension of Optimal Static Range Reporting in One Dimension Stephen Alstrup Gerth Stølting Brodal Theis Rauhe ITU Technical Report Series 2000-3 ISSN 1600 6100 November 2000 Copyright c 2000, Stephen Alstrup Gerth

More information

Computing optimal linear layouts of trees in linear time

Computing optimal linear layouts of trees in linear time Computing optimal linear layouts of trees in linear time Konstantin Skodinis University of Passau, 94030 Passau, Germany, e-mail: skodinis@fmi.uni-passau.de Abstract. We present a linear time algorithm

More information

Time-space tradeoff lower bounds for randomized computation of decision problems

Time-space tradeoff lower bounds for randomized computation of decision problems Time-space tradeoff lower bounds for randomized computation of decision problems Paul Beame Ý Computer Science and Engineering University of Washington Seattle, WA 98195-2350 beame@cs.washington.edu Xiaodong

More information

Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405

Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 Graphs (MTAT.05.080, 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 homepage: http://www.ut.ee/~peeter_l/teaching/graafid08s (contains slides) For grade:

More information

Updating K-d Trees. Amalia Duch Conrado Martínez. Univ. Politècnica de Catalunya, Spain

Updating K-d Trees. Amalia Duch Conrado Martínez. Univ. Politècnica de Catalunya, Spain Updating K-d Trees Amalia Duch Conrado Martínez Univ. Politècnica de Catalunya, Spain 1 Introduction 2 Updating with split and join 3 Analysis of split and join 4 Copy-based updates 5 Analysis of copy-based

More information

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols Christian Scheideler Ý Berthold Vöcking Þ Abstract We investigate how static store-and-forward routing algorithms

More information

Multicast Topology Inference from End-to-end Measurements

Multicast Topology Inference from End-to-end Measurements Multicast Topology Inference from End-to-end Measurements N.G. Duffield Þ J. Horowitz Đ F. Lo Presti ÞÜ D. Towsley Ü Þ AT&T Labs Research Đ Dept. Math. & Statistics Ü Dept. of Computer Science 180 Park

More information

B-trees and Pólya urns

B-trees and Pólya urns B-trees and Pólya urns Danièle GARDY PRiSM (UVSQ) with B. Chauvin and N. Pouyanne (LMV) and D.-H. Ton-That (PRiSM) AofA, Strobl June 2015 B-trees and algorithms Some enumeration problems Pólya urns B-trees

More information

Online Facility Location

Online Facility Location Online Facility Location Adam Meyerson Abstract We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these

More information

Concurrent Execution

Concurrent Execution Concurrent Execution Overview: concepts and definitions modelling: parallel composition action interleaving algebraic laws shared actions composite processes process labelling, action relabeling and hiding

More information

A Comparison of Structural CSP Decomposition Methods

A Comparison of Structural CSP Decomposition Methods A Comparison of Structural CSP Decomposition Methods Georg Gottlob Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria. E-mail: gottlob@dbai.tuwien.ac.at Nicola Leone

More information

Bayesian source separation with mixture of Gaussians prior for sources and Gaussian prior for mixture coefficients

Bayesian source separation with mixture of Gaussians prior for sources and Gaussian prior for mixture coefficients Bayesian source separation with mixture of Gaussians prior for sources and Gaussian prior for mixture coefficients Hichem Snoussi and Ali Mohammad-Djafari Laboratoire des Signaux et Systèmes (LS), Supélec,

More information

Models, Notation, Goals

Models, Notation, Goals Scope Ë ÕÙ Ò Ð Ò ÐÝ Ó ÝÒ Ñ ÑÓ Ð Ü Ô Ö Ñ Ö ² Ñ ¹Ú ÖÝ Ò Ú Ö Ð Ö ÒÙÑ Ö Ð ÔÓ Ö ÓÖ ÔÔÖÓÜ Ñ ÓÒ ß À ÓÖ Ð Ô Ö Ô Ú ß Ë ÑÙÐ ÓÒ Ñ Ó ß ËÑÓÓ Ò ² Ö Ò Ö Ò Ô Ö Ñ Ö ÑÔÐ ß Ã ÖÒ Ð Ñ Ó ÚÓÐÙ ÓÒ Ñ Ó ÓÑ Ò Ô Ö Ð Ð Ö Ò Ð ÓÖ Ñ

More information

Exponentiated Gradient Algorithms for Large-margin Structured Classification

Exponentiated Gradient Algorithms for Large-margin Structured Classification Exponentiated Gradient Algorithms for Large-margin Structured Classification Peter L. Bartlett U.C.Berkeley bartlett@stat.berkeley.edu Ben Taskar Stanford University btaskar@cs.stanford.edu Michael Collins

More information

Response Time Analysis of Asynchronous Real-Time Systems

Response Time Analysis of Asynchronous Real-Time Systems Response Time Analysis of Asynchronous Real-Time Systems Guillem Bernat Real-Time Systems Research Group Department of Computer Science University of York York, YO10 5DD, UK Technical Report: YCS-2002-340

More information

From Tableaux to Automata for Description Logics

From Tableaux to Automata for Description Logics Fundamenta Informaticae XX (2003) 1 33 1 IOS Press From Tableaux to Automata for Description Logics Franz Baader, Jan Hladik, and Carsten Lutz Theoretical Computer Science, TU Dresden, D-01062 Dresden,

More information

Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem

Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem Frank Neumann Institut für Informatik und Praktische Mathematik Christian-Albrechts-Universität zu Kiel 24098 Kiel, Germany fne@informatik.uni-kiel.de

More information

On the Performance of Greedy Algorithms in Packet Buffering

On the Performance of Greedy Algorithms in Packet Buffering On the Performance of Greedy Algorithms in Packet Buffering Susanne Albers Ý Markus Schmidt Þ Abstract We study a basic buffer management problem that arises in network switches. Consider input ports,

More information

Comparing Data Compression in Web-based Animation Models using Kolmogorov Complexity

Comparing Data Compression in Web-based Animation Models using Kolmogorov Complexity Comparing Data Compression in Web-based Animation Models using Kolmogorov Complexity Carlos A. P. Campani, Fernando Accorsi, Paulo Blauth Menezes and Luciana Porcher Nedel Abstract In the last few years,

More information

Optimal Time Bounds for Approximate Clustering

Optimal Time Bounds for Approximate Clustering Optimal Time Bounds for Approximate Clustering Ramgopal R. Mettu C. Greg Plaxton Department of Computer Science University of Texas at Austin Austin, TX 78712, U.S.A. ramgopal, plaxton@cs.utexas.edu Abstract

More information

Adaptive and Incremental Processing for Distance Join Queries

Adaptive and Incremental Processing for Distance Join Queries Adaptive and Incremental Processing for Distance Join Queries Hyoseop Shin Ý Bongki Moon Þ Sukho Lee Ý Ý Þ School of Computer Engineering Department of Computer Science Seoul National University University

More information

Adaptive techniques for spline collocation

Adaptive techniques for spline collocation Adaptive techniques for spline collocation Christina C. Christara and Kit Sun Ng Department of Computer Science University of Toronto Toronto, Ontario M5S 3G4, Canada ccc,ngkit @cs.utoronto.ca July 18,

More information

A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem

A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem Mohammad Mahdian Yinyu Ye Ý Jiawei Zhang Þ Abstract This paper is divided into two parts. In the first part of this paper,

More information

A sharp threshold in proof complexity yields lower bounds for satisfiability search

A sharp threshold in proof complexity yields lower bounds for satisfiability search A sharp threshold in proof complexity yields lower bounds for satisfiability search Dimitris Achlioptas Microsoft Research One Microsoft Way Redmond, WA 98052 optas@microsoft.com Michael Molloy Ý Department

More information

Directed Single Source Shortest Paths in Linear Average Case Time

Directed Single Source Shortest Paths in Linear Average Case Time Directed Single Source Shortest Paths in inear Average Case Time Ulrich Meyer MPI I 2001 1-002 May 2001 Author s Address ÍÐÖ ÅÝÖ ÅܹÈÐÒ¹ÁÒ ØØÙØ ĐÙÖ ÁÒÓÖÑØ ËØÙÐ ØÞÒÙ Û ½¾ ËÖÖĐÙÒ umeyer@mpi-sb.mpg.de www.uli-meyer.de

More information

Pointers & Arrays. CS2023 Winter 2004

Pointers & Arrays. CS2023 Winter 2004 Pointers & Arrays CS2023 Winter 2004 Outcomes: Pointers & Arrays C for Java Programmers, Chapter 8, section 8.12, and Chapter 10, section 10.2 Other textbooks on C on reserve After the conclusion of this

More information

Banner 8 Using International Characters

Banner 8 Using International Characters College of William and Mary Banner 8 Using International Characters A Reference and Training Guide Banner Support January 23, 2009 Table of Contents Windows XP Keyboard Setup 3 VISTA Keyboard Setup 7 Creating

More information

On Clusterings Good, Bad and Spectral

On Clusterings Good, Bad and Spectral On Clusterings Good, Bad and Spectral Ravi Kannan Computer Science, Yale University. kannan@cs.yale.edu Santosh Vempala Ý Mathematics, M.I.T. vempala@math.mit.edu Adrian Vetta Þ Mathematics, M.I.T. avetta@math.mit.edu

More information

A Comparison of Algorithms for Inference and Learning in Probabilistic Graphical Models

A Comparison of Algorithms for Inference and Learning in Probabilistic Graphical Models University of Toronto Technical Report PSI-2003-22, April, 2003. To appear in IEEE Transactions on Pattern Analysis and Machine Intelligence. A Comparison of Algorithms for Inference and Learning in Probabilistic

More information

Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems

Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems Paul Beame Computer Science and Engineering University of Washington Seattle, WA 98195-2350 beame@cs.washington.edu

More information

On-line multiplication in real and complex base

On-line multiplication in real and complex base On-line multiplication in real complex base Christiane Frougny LIAFA, CNRS UMR 7089 2 place Jussieu, 75251 Paris Cedex 05, France Université Paris 8 Christiane.Frougny@liafa.jussieu.fr Athasit Surarerks

More information

Computation of the multivariate Oja median

Computation of the multivariate Oja median Metrika manuscript No. (will be inserted by the editor) Computation of the multivariate Oja median T. Ronkainen, H. Oja, P. Orponen University of Jyväskylä, Department of Mathematics and Statistics, Finland

More information

The Online Median Problem

The Online Median Problem The Online Median Problem Ramgopal R. Mettu C. Greg Plaxton November 1999 Abstract We introduce a natural variant of the (metric uncapacitated) -median problem that we call the online median problem. Whereas

More information

Agglomerative Information Bottleneck

Agglomerative Information Bottleneck Agglomerative Information Bottleneck Noam Slonim Naftali Tishby Institute of Computer Science and Center for Neural Computation The Hebrew University Jerusalem, 91904 Israel email: noamm,tishby@cs.huji.ac.il

More information

Distributed Construction of a Fault-Tolerant Network from a Tree

Distributed Construction of a Fault-Tolerant Network from a Tree Distributed Construction of a Fault-Tolerant Network from a Tree Michael K. Reiter 1 Asad Samar 2 Chenxi Wang 2 February 2005 CMU-CS-05-114 School of Computer Science Carnegie Mellon University Pittsburgh,

More information

A General Greedy Approximation Algorithm with Applications

A General Greedy Approximation Algorithm with Applications A General Greedy Approximation Algorithm with Applications Tong Zhang IBM T.J. Watson Research Center Yorktown Heights, NY 10598 tzhang@watson.ibm.com Abstract Greedy approximation algorithms have been

More information

Expander-based Constructions of Efficiently Decodable Codes

Expander-based Constructions of Efficiently Decodable Codes Expander-based Constructions of Efficiently Decodable Codes (Extended Abstract) Venkatesan Guruswami Piotr Indyk Abstract We present several novel constructions of codes which share the common thread of

More information

Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams

Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams Henrik Hulgaard, Poul Frederick Williams, and Henrik Reif Andersen Abstract The combinational logic-level equivalence problem

More information

A Note on Karr s Algorithm

A Note on Karr s Algorithm A Note on Karr s Algorithm Markus Müller-Olm ½ and Helmut Seidl ¾ ½ FernUniversität Hagen, FB Informatik, LG PI 5, Universitätsstr. 1, 58097 Hagen, Germany mmo@ls5.informatik.uni-dortmund.de ¾ TU München,

More information

Cartons (PCCs) Management

Cartons (PCCs) Management Final Report Project code: 2015 EE04 Post-Consumer Tetra Pak Cartons (PCCs) Management Prepared for Tetra Pak India Pvt. Ltd. Post Consumer Tetra Pak Cartons (PCCs) Management! " # $ " $ % & ' ( ) * +,

More information

A Robust Class of Context-Sensitive Languages

A Robust Class of Context-Sensitive Languages A Robust Class of Context-Sensitive Languages Salvatore La Torre Università di Salerno, Italy latorre@dia.unisa.it P. Madhusudan University of Illinois Urbana-Champaign, USA madhu@uiuc.edu Gennaro Parlato

More information

End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks

End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks Saswati Sarkar and Leandros Tassiulas 1 Abstract Sharing the locally common spectrum among the links of the

More information

O-Trees: a Constraint-based Index Structure

O-Trees: a Constraint-based Index Structure O-Trees: a Constraint-based Index Structure Inga Sitzmann and Peter Stuckey Department of Computer Science and Software Engineering The University of Melbourne Parkville, Victoria, 3052 inga,pjs @cs.mu.oz.au

More information

A New Algorithm for the Reconstruction of Near-Perfect Binary Phylogenetic Trees

A New Algorithm for the Reconstruction of Near-Perfect Binary Phylogenetic Trees A New Algorithm for the Reconstruction of Near-Perfect Binary Phylogenetic Trees Kedar Dhamdhere ½ ¾, Srinath Sridhar ½ ¾, Guy E. Blelloch ¾, Eran Halperin R. Ravi and Russell Schwartz March 17, 2005 CMU-CS-05-119

More information

On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems.

On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems. On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems. Andrei Rădulescu Arjan J.C. van Gemund Faculty of Information Technology and Systems Delft University of Technology P.O.Box

More information

A Modality for Recursion

A Modality for Recursion A Modality for Recursion (Technical Report) March 31, 2001 Hiroshi Nakano Ryukoku University, Japan nakano@mathryukokuacjp Abstract We propose a modal logic that enables us to handle self-referential formulae,

More information

Unified Configuration Knowledge Representation Using Weight Constraint Rules

Unified Configuration Knowledge Representation Using Weight Constraint Rules Unified Configuration Knowledge Representation Using Weight Constraint Rules Timo Soininen ½ and Ilkka Niemelä ¾ and Juha Tiihonen ½ and Reijo Sulonen ½ Abstract. In this paper we present an approach to

More information

Rank Selection in Multidimensional Data

Rank Selection in Multidimensional Data Rank Selection in Multidimensional Data Amalia Duch, Rosa M. Jiménez, Conrado Martínez Univ. Politècnica Catalunya AofA 2011, Bedlewo, Poland Joint work with: Amalia Duch Rosa M. Jiménez Introduction The

More information

Concurrent Architectures - Unix: Sockets, Select & Signals

Concurrent Architectures - Unix: Sockets, Select & Signals Concurrent Architectures - Unix: Sockets, Select & Signals Assignment 1: Drop In Labs reminder check compiles in CS labs & you have submitted all your files in StReAMS! formatting your work: why to 80

More information

Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network

Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network 1 Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network Abhishek Kumar Shashidhar Merugu Jun (Jim) Xu Xingxing Yu College of Computing, School of Mathematics, Georgia Institute of Technology,

More information

) $ G}] }O H~U. G yhpgxl. Cong

) $ G}] }O H~U. G yhpgxl. Cong » Þ åî ïî á ë ïý þý ÿ þ ë ú ú F \ Œ Œ Ÿ Ÿ F D D D\ \ F F D F F F D D F D D D F D D D D FD D D D F D D FD F F F F F F F D D F D F F F D D D D F Ÿ Ÿ F D D Œ Ÿ D Ÿ Ÿ FŸ D c ³ ² í ë óô ò ð ¹ í ê ë Œ â ä ã

More information

Scaling Properties of the Internet Graph

Scaling Properties of the Internet Graph Scaling Properties of the Internet Graph Aditya Akella Shuchi Chawla Arvind Kannan Srinivasan Seshan Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 aditya,shuchi @cs.cmu.edu

More information

Planar graphs, negative weight edges, shortest paths, and near linear time

Planar graphs, negative weight edges, shortest paths, and near linear time Planar graphs, negative weight edges, shortest paths, and near linear time Jittat Fakcharoenphol Satish Rao Ý Abstract In this paper, we present an Ç Ò ÐÓ Òµ time algorithm for finding shortest paths in

More information

124 DISTO pro 4 / pro 4 a-1.0.0zh

124 DISTO pro 4 / pro 4 a-1.0.0zh 0 30 40 50 DISTO PD-Z01 14 DISTO pro 4 / pro 4 a-1.0.0 DISTO pro 4 / pro 4 a-1.0.0 15 16 DISTO pro 4 / pro 4 a-1.0.0 DISTO pro 4 / pro 4 a-1.0.0 17 1 PD-Z03 3 7 4 5 6 10 9 8 18 DISTO pro 4 / pro 4 a-1.0.0

More information

Structure and Complexity in Planning with Unary Operators

Structure and Complexity in Planning with Unary Operators Structure and Complexity in Planning with Unary Operators Carmel Domshlak and Ronen I Brafman ½ Abstract In this paper we study the complexity of STRIPS planning when operators have a single effect In

More information

SIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION FOR REAL-TIME OPTIMIZATION OF MODEL PREDICTIVE CONTROL

SIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION FOR REAL-TIME OPTIMIZATION OF MODEL PREDICTIVE CONTROL SIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION FOR REAL-TIME OPTIMIZATION OF MODEL PREDICTIVE CONTROL Irina Baltcheva Felisa J.Vázquez-Abad ½ (member of GERAD) Université de Montréal DIRO, CP 6128

More information

Disjoint, Partition and Intersection Constraints for Set and Multiset Variables

Disjoint, Partition and Intersection Constraints for Set and Multiset Variables Disjoint, Partition and Intersection Constraints for Set and Multiset Variables Christian Bessiere ½, Emmanuel Hebrard ¾, Brahim Hnich ¾, and Toby Walsh ¾ ¾ ½ LIRMM, Montpelier, France. Ö Ð ÖÑÑ Ö Cork

More information

Lecture 5 C Programming Language

Lecture 5 C Programming Language Lecture 5 C Programming Language Summary of Lecture 5 Pointers Pointers and Arrays Function arguments Dynamic memory allocation Pointers to functions 2D arrays Addresses and Pointers Every object in the

More information

Design of Logical Topologies in Wavelength-Routed IP Networks

Design of Logical Topologies in Wavelength-Routed IP Networks DESIGN OF LOGICAL TOPOLOGIES... 1 Design of Logical Topologies in Wavelength-Routed IP Networks M.Ajmone Marsan ½ A.Grosso ¾, E.Leonardi ½, M.Mellia ½, A.Nucci ½ ½ Dipartimento di Elettronica - Politecnico

More information

A Proposal for the Implementation of a Parallel Watershed Algorithm

A Proposal for the Implementation of a Parallel Watershed Algorithm A Proposal for the Implementation of a Parallel Watershed Algorithm A. Meijster and J.B.T.M. Roerdink University of Groningen, Institute for Mathematics and Computing Science P.O. Box 800, 9700 AV Groningen,

More information

Fast Broadcasting and Gossiping in Radio Networks

Fast Broadcasting and Gossiping in Radio Networks Fast Broadcasting and Gossiping in Radio Networks Marek Chrobak Leszek Ga sieniec Ý Wojciech Rytter Þ Abstract We establish an Ç Ò ÐÓ ¾ Òµ upper bound on the time for deterministic distributed broadcasting

More information

Online Aggregation over Trees

Online Aggregation over Trees Online Aggregation over Trees C. Greg Plaxton, Mitul Tiwari University of Texas at Austin Praveen Yalagandula HP Labs Abstract Consider a distributed network with nodes arranged in a tree, and each node

More information

Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D Ý

Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D Ý Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D Ý Pankaj K. Agarwal Þ Rolf Klein Ü Christian Knauer ß Stefan Langerman Pat Morin Micha Sharir ÝÝ Michael Soss ÞÞ April 18,

More information

A Hybrid Indexing Method for Approximate String Matching

A Hybrid Indexing Method for Approximate String Matching A Hybrid Indexing Method for Approximate String Matching GONZALO NAVARRO 1, Dept. of Computer Science, University of Chile. Blanco Encalada 212, Santiago, Chile. gnavarro@dcc.uchile.cl RICARDO BAEZA-YATES

More information

³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ

³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ È Ò È Æ ÇÊÊÄÌÁÇÆË È ÅÁÍŹÏÁÀÌ ÆÍÄÁ ÁÆ Åº ÐÚÓÐ ÂÄ ÇØÓÖ ¾¼¼ ½ ³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ À Ò Ò Ò ÛØ À Ç Òµ Ú Ò µ Ç Òµ

More information

Cofactoring-Based Upper Bound Computation for Covering Problems

Cofactoring-Based Upper Bound Computation for Covering Problems TR-CSE-98-06, UNIVERSITY OF MASSACHUSETTS AMHERST Cofactoring-Based Upper Bound Computation for Covering Problems Congguang Yang Maciej Ciesielski May 998 TR-CSE-98-06 Department of Electrical and Computer

More information

Pointers. CS2023 Winter 2004

Pointers. CS2023 Winter 2004 Pointers CS2023 Winter 2004 Outcomes: Introduction to Pointers C for Java Programmers, Chapter 8, sections 8.1-8.8 Other textbooks on C on reserve After the conclusion of this section you should be able

More information

Cycle cover with short cycles

Cycle cover with short cycles Cycle cover with short cycles Nicole Immorlica Mohammad Mahdian Vahab S. Mirrokni Abstract Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms

More information

Graph Traversal. 1 Breadth First Search. Correctness. find all nodes reachable from some source node s

Graph Traversal. 1 Breadth First Search. Correctness. find all nodes reachable from some source node s 1 Graph Traversal 1 Breadth First Search visit all nodes and edges in a graph systematically gathering global information find all nodes reachable from some source node s Prove this by giving a minimum

More information

A Generalized Framework for Analyzing Time-Space Switched Optical Networks

A Generalized Framework for Analyzing Time-Space Switched Optical Networks R. SRINIVASAN AND A. K. SOMANI: A GENERALIZED FRAMEWORK FOR ANALYZING TIME-SPACE SWITCHED OPTICAL NETWORKS 1 A Generalized Framework for Analyzing Time-Space ed Optical Networks R. Srinivasan and Arun

More information

Online Scheduling for Sorting Buffers

Online Scheduling for Sorting Buffers Online Scheduling for Sorting Buffers Harald Räcke ½, Christian Sohler ½, and Matthias Westermann ¾ ½ Heinz Nixdorf Institute and Department of Mathematics and Computer Science Paderborn University, D-33102

More information

Extending Conceptual Logic Programs with Arbitrary Rules

Extending Conceptual Logic Programs with Arbitrary Rules Extending Conceptual Logic Programs with Arbitrary Rules Stijn Heymans, Davy Van Nieuwenborgh, and Dirk Vermeir Dept. of Computer Science Vrije Universiteit Brussel, VUB Pleinlaan 2, B1050 Brussels, Belgium

More information

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms CS245-2008S-19 B-Trees David Galles Department of Computer Science University of San Francisco 19-0: Indexing Operations: Add an element Remove an element Find an element,

More information

Indexing Mobile Objects Using Dual Transformations

Indexing Mobile Objects Using Dual Transformations Indexing Mobile Objects Using Dual Transformations George Kollios Boston University gkollios@cs.bu.edu Dimitris Papadopoulos UC Riverside tsotras@cs.ucr.edu Dimitrios Gunopulos Ý UC Riverside dg@cs.ucr.edu

More information

A Blind Source Separation Approach to Structure From Motion

A Blind Source Separation Approach to Structure From Motion A Blind Source Separation Approach to Structure From Motion Jeff Fortuna and Aleix M. Martinez Department of Electrical & Computer Engineering The Ohio State University Columbus, Ohio, 4321 Abstract We

More information

Propagating XML Constraints to Relations

Propagating XML Constraints to Relations Propagating XML Constraints to Relations Susan Davidson U. of Pennsylvania Wenfei Fan Ý Bell Labs Carmem Hara U. Federal do Parana, Brazil Jing Qin Temple U. Abstract We present a technique for refining

More information

Broadcast Encryption

Broadcast Encryption Broadcast Encryption Amos Fiat Ý Moni Naor Þ Abstract We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The

More information

Collision Detection for Deforming Necklaces

Collision Detection for Deforming Necklaces Collision Detection for Deforming Necklaces Pankaj K. Agarwal Ý Leonidas Guibas Þ An Nguyen Ü Daniel Russel ß Li Zhang November 6, 2003 Abstract In this paper, we propose to study deformable necklaces

More information

DYNAMIC PATTERN MATCHING ½

DYNAMIC PATTERN MATCHING ½ DYNAMIC PATTERN MATCHING ½ STEPHEN ALSTRUP ¾ GERTH STØLTING BRODAL THEIS RAUHE ABSTRACT. Pattern matching is the problem of finding all occurrences of a pattern in a text. For a long period of time significant

More information

Correlation Clustering

Correlation Clustering Correlation Clustering Nikhil Bansal Avrim Blum Shuchi Chawla Abstract We consider the following clustering problem: we have a complete graph on Ò vertices (items), where each edge Ù Úµ is labeled either

More information

Information-Theoretic Private Information Retrieval: A Unified Construction (Extended Abstract)

Information-Theoretic Private Information Retrieval: A Unified Construction (Extended Abstract) Information-Theoretic Private Information Retrieval: A Unified Construction (Extended Abstract) Amos Beimel ½ and Yuval Ishai ¾ ¾ ½ Ben-Gurion University, Israel. beimel@cs.bgu.ac.il. DIMACS and AT&T Labs

More information

The Tractability of Global Constraints

The Tractability of Global Constraints The Tractability of Global Constraints Christian Bessiere ½, Emmanuel Hebrard ¾, Brahim Hnich ¾, and Toby Walsh ¾ ¾ ½ LIRMM-CNRS, Montpelier, France. bessiere@lirmm.fr Cork Constraint Computation Center,

More information

Monotonicity testing over general poset domains

Monotonicity testing over general poset domains Monotonicity testing over general poset domains [Extended Abstract] Eldar Fischer Technion Haifa, Israel eldar@cs.technion.ac.il Sofya Raskhodnikova Ý LCS, MIT Cambridge, MA 02139 sofya@mit.edu Eric Lehman

More information

Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk

Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk Ashish Goel Ý Stanford University Deborah Estrin Þ University of California, Los Angeles Abstract We consider

More information

Optimization of Memory Usage and Communication Requirements for a Class of Loops Implementing Multi-Dimensional Integrals

Optimization of Memory Usage and Communication Requirements for a Class of Loops Implementing Multi-Dimensional Integrals Optimization of Memory Usage and Communication Requirements for a Class of Loops Implementing Multi-Dimensional Integrals Chi-Chung LamÝ, Daniel CociorvaÞ, Gerald BaumgartnerÝ, P. SadayappanÝ ÝDepartment

More information

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC This update to the AppleShare PC User's Guide discusses AppleShare PC support for the use of international character sets, paper sizes, and date

More information

Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling

Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling Weizhen Mao Department of Computer Science The College of William and Mary Williamsburg, VA 23187-8795 USA wm@cs.wm.edu

More information

Improved Algorithm for Minimum Flows in Bipartite Networks with Unit Capacities

Improved Algorithm for Minimum Flows in Bipartite Networks with Unit Capacities Improved Algorithm for Minimum Flows in Bipartite Networks with Unit Capacities ELEONOR CIUREA Transilvania University of Braşov Theoretical Computer Science Departement Braşov, Iuliu Maniu 50, cod 500091

More information

Practical aspects in compiling tabular TAG parsers

Practical aspects in compiling tabular TAG parsers Workshop TAG+5, Paris, 25-27 May 2000 Practical aspects in compiling tabular TAG parsers Miguel A. Alonso Ý, Djamé Seddah Þ, and Éric Villemonte de la Clergerie Ý Departamento de Computación, Universidad

More information

Turbulence et Génération de Bruit Equipe de recherche du Centre Acoustique LMFA, UMR CNRS 5509, Ecole Centrale de Lyon Simulation Numérique en Aéroacoustique Institut Henri Poincaré - 16 novembre 2006

More information

Distribution of tree parameters

Distribution of tree parameters Distribution of tree parameters Stephan Wagner Stellenbosch University Strathmore conference, 23 June 2017 Trees Trees are one of the simplest and best-studied classes of graphs. They are characterised

More information