Sciweavers

2703 search results - page 462 / 541
» Working Class Hero
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
OSDI
2008
ACM
14 years 10 months ago
Automating Network Application Dependency Discovery: Experiences, Limitations, and New Solutions
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
Xu Chen, Ming Zhang, Zhuoqing Morley Mao, Paramvir...
ICALP
2009
Springer
14 years 10 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
VLDB
2004
ACM
112views Database» more  VLDB 2004»
14 years 10 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 10 months ago
Advances in flash memory SSD technology for enterprise database applications
The past few decades have witnessed a chronic and widening imbalance among processor bandwidth, disk capacity, and access speed of disk. According to Amdhal's law, the perfor...
Sang-Won Lee, Bongki Moon, Chanik Park