Sciweavers

1389 search results - page 255 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
SIGMOD
2003
ACM
111views Database» more  SIGMOD 2003»
15 years 10 months ago
Extended Wavelets for Multiple Measures
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
Antonios Deligiannakis, Nick Roussopoulos
FOCS
2009
IEEE
15 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
INFOCOM
2007
IEEE
15 years 4 months ago
Small Active Counters
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
Rade Stanojevic
VLDB
2007
ACM
105views Database» more  VLDB 2007»
15 years 4 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim