Sciweavers

4009 search results - page 746 / 802
» Clustering on Complex Graphs
Sort
View
156
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Threshold compression for 3G scalable monitoring
—We study the problem of scalable monitoring of operational 3G wireless networks. Threshold-based performance monitoring in large 3G networks is very challenging for two main fac...
Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Io...
DIMACS
1996
15 years 5 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
WWW
2006
ACM
16 years 4 months ago
Site level noise removal for search engines
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their ...
André Luiz da Costa Carvalho, Paul-Alexandr...
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...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 4 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami