231 search results - page 15 / 47 » Sublinear time approximate clustering |
94
Voted
BROADNETS
2004
IEEE
15 years 4 months ago
2004
IEEE
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...
105
Voted
DASFAA
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
233
click to vote
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
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...
129
Voted
ICDAR
2011
IEEE
14 years 2 days ago
2011
IEEE
—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 ...
111
click to vote
SIGIR
1999
ACM
15 years 4 months ago
1999
ACM
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 ...