Sciweavers

2310 search results - page 347 / 462
» Coloring Random Graphs
Sort
View
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
14 years 23 days ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 3 days ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 8 months ago
Probabilistic Analysis of Linear Programming Decoding
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
Constantinos Daskalakis, Alexandros G. Dimakis, Ri...
TIT
2008
103views more  TIT 2008»
13 years 7 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
CVPR
2009
IEEE
1148views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Shape Constrained Figure-Ground Segmentation and Tracking
Global shape information is an effective top-down complement to bottom-up figure-ground segmentation as well as a useful constraint to avoid drift during adaptive tracking. We p...
Zhaozheng Yin, Robert T. Collins