Sciweavers

2814 search results - page 393 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
94
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
105
Voted
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
15 years 7 months ago
CoTS: A Scalable Framework for Parallelizing Frequency Counting over Data Streams
Applications involving analysis of data streams have gained significant popularity and importance. Frequency counting, frequent elements and top-k queries form a class of operato...
Sudipto Das, Shyam Antony, Divyakant Agrawal, Amr ...
KBSE
2010
IEEE
14 years 11 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
107
Voted
ICCV
2007
IEEE
16 years 2 months ago
Differential EMD Tracking
Illumination changes cause object appearance to change drastically and many existing tracking algorithms lack the capability to handle this problem. The Earth Mover's Distanc...
Qi Zhao, Shane Brennan, Hai Tao
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 1 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella