Sciweavers

263 search results - page 23 / 53
» Efficient gossip-based aggregate computation
Sort
View
DEXA
2010
Springer
319views Database» more  DEXA 2010»
14 years 10 months ago
An Efficient Similarity Join Algorithm with Cosine Similarity Predicate
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
Dongjoo Lee, Jaehui Park, Junho Shim, Sang-goo Lee
ECCV
2010
Springer
15 years 2 months ago
Using Partial Edge Contour Matches for Efficient Object Category Localization
Abstract. We propose a method for object category localization by partially matching edge contours to a single shape prototype of the category. Previous work in this area either re...
Hayko Riemenschneider, Michael Donoser, and Horst ...
COLING
2010
14 years 5 months ago
Efficient Statement Identification for Automatic Market Forecasting
Strategic business decision making involves the analysis of market forecasts. Today, the identification and aggregation of relevant market statements is done by human experts, oft...
Henning Wachsmuth, Peter Prettenhofer, Benno Stein
EWSN
2004
Springer
15 years 9 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
DKE
2008
79views more  DKE 2008»
14 years 10 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis