Sciweavers

231 search results - page 15 / 47
» Sublinear time approximate clustering
Sort
View
BROADNETS
2004
IEEE
13 years 11 months ago
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
Murat Demirbas, Anish Arora, Vineet Mittal, Vinod ...
DASFAA
2007
IEEE
178views Database» more  DASFAA 2007»
14 years 1 months ago
ClusterSheddy : Load Shedding Using Moving Clusters over Spatio-temporal Data Streams
Abstract. Moving object environments are characterized by large numbers of objects continuously sending location updates. At times, data arrival rates may spike up, causing the loa...
Rimma V. Nehme, Elke A. Rundensteiner
ICDE
2001
IEEE
206views Database» more  ICDE 2001»
14 years 8 months ago
Cache-Aware Query Routing in a Cluster of Databases
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...
ICDAR
2011
IEEE
12 years 7 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
SIGIR
1999
ACM
13 years 11 months ago
Content-Based Retrieval for Music Collections
A content-based retrieval model for tackling the mismatch problems specific to music data is proposed and implemented. The system uses a pitch profile encoding for queries in any ...
Yuen-Hsien Tseng