Sciweavers

2805 search results - page 99 / 561
» Collecting More Garbage
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 2 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
INFOCOM
2006
IEEE
15 years 11 months ago
Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
Abhishek Kumar, Jun Xu
EDBT
2010
ACM
210views Database» more  EDBT 2010»
15 years 7 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
NECO
2011
14 years 12 months ago
Collective Stability of Networks of Winner-Take-All Circuits
The neocortex has a remarkably uniform neuronal organization, suggesting that common principles of processing are employed throughout its extent. In particular, the patterns of co...
Ueli Rutishauser, Rodney J. Douglas, Jean-Jacques ...
131
Voted
DAC
2010
ACM
15 years 9 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler