Sciweavers

4313 search results - page 100 / 863
» Using time travel to diagnose computer problems
Sort
View
AAAI
2006
15 years 5 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 5 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
IPPS
2009
IEEE
15 years 11 months ago
Using a market economy to provision compute resources across planet-wide clusters
—We present a practical, market-based solution to the resource provisioning problem in a set of heterogeneous resource clusters. We focus on provisioning rather than immediate sc...
Murray Stokely, Jim Winget, E. Keyes, C. Grimes, B...
134
Voted
PAMI
2010
112views more  PAMI 2010»
15 years 2 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
SAC
2010
ACM
15 years 11 months ago
Coverage-hole trap model in target tracking using distributed relay-robot network
Target tracking is an important issue in wireless sensor network applications. In this paper, we design a Coverage-Hole Trap Model (CTM) based on a system that contains one moving...
Huawei Miao, Chia-Ching Ooi, Xiaowen Wu, Christian...