Sciweavers

2383 search results - page 246 / 477
» Finding Representative Set from Massive Data
Sort
View
237
Voted
SIGMOD
2005
ACM
212views Database» more  SIGMOD 2005»
16 years 6 months ago
A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...
Philip Bohannon, Michael Flaster, Wenfei Fan, Raje...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 3 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
169
Voted
ICMCS
2006
IEEE
145views Multimedia» more  ICMCS 2006»
16 years 5 days ago
A New Study on Distance Metrics as Similarity Measurement
Distance metric is widely used in similarity estimation. In this paper we find that the most popular Euclidean and Manhattan distance may not be suitable for all data distribution...
Jie Yu, Jaume Amores, Nicu Sebe, Qi Tian
TCAD
2008
103views more  TCAD 2008»
15 years 6 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni
ICPR
2008
IEEE
16 years 7 months ago
Detecting and ordering salient regions for efficient browsing
We describe an ensemble approach to learning1 salient regions from data partitioned according to the2 distributed processing requirements of large-scale sim-3 ulations. The volume...
Larry Shoemaker, Robert E. Banfield, Larry O. Hall...