Sciweavers

2392 search results - page 150 / 479
» Matching data dissemination algorithms to application requir...
Sort
View
ICDCS
2006
IEEE
16 years 17 days ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
CACM
2008
84views more  CACM 2008»
15 years 6 months ago
The emergence of a networking primitive in wireless sensor networks
The wireless sensor network community approached netabstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic...
Philip Levis, Eric A. Brewer, David E. Culler, Dav...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 9 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ACIVS
2009
Springer
15 years 11 months ago
Vehicle Tracking Using Geometric Features
Applications such as traffic surveillance require a real-time and accurate method for object tracking. We propose to represent scene observations with parabola segments with an alg...
Francis Deboeverie, Kristof Teelen, Peter Veelaert...
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
16 years 1 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin