Sciweavers

7228 search results - page 232 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 11 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 4 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
MOBIHOC
2004
ACM
16 years 3 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 10 months ago
Genetic algorithms for large join query optimization
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
Hongbin Dong, Yiwen Liang
WWW
2009
ACM
16 years 4 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...