Sciweavers

478 search results - page 25 / 96
» A simple expected running time analysis for randomized
Sort
View
PODC
2004
ACM
14 years 1 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
RSA
2000
170views more  RSA 2000»
13 years 8 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
ANLP
2000
96views more  ANLP 2000»
13 years 9 months ago
Efficient parsing strategies for syntactic analysis of closed captions
We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...
Krzysztof Czuba
FOCS
2006
IEEE
14 years 2 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
IPPS
2002
IEEE
14 years 1 months ago
A Prediction-Based Real-Time Scheduling Advisor
The real-time scheduling advisor (RTSA) is an entirely userlevel system that an application running on a typical shared, unreserved distributed computing environment can turn to f...
Peter A. Dinda