Sciweavers

604 search results - page 61 / 121
» The Hardness of Metric Labeling
Sort
View
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
13 years 12 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
CCS
2008
ACM
13 years 10 months ago
The risk-utility tradeoff for IP address truncation
Network operators are reluctant to share traffic data due to security and privacy concerns. Consequently, there is a lack of publicly available traces for validating and generaliz...
Martin Burkhart, Daniela Brauckhoff, Martin May, E...
IMC
2007
ACM
13 years 9 months ago
Compressed network monitoring for ip and all-optical networks
We address the problem of efficient end-to-end network monitoring of path metrics in communication networks. Our goal is to minimize the number of measurements or monitors requir...
Mark Coates, Yvan Pointurier, Michael Rabbat
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
SIGSOFT
2010
ACM
13 years 5 months ago
The missing links: bugs and bug-fix commits
Empirical studies of software defects rely on links between bug databases and program code repositories. This linkage is typically based on bug-fixes identified in developer-enter...
Adrian Bachmann, Christian Bird, Foyzur Rahman, Pr...