1385 search results - page 15 / 277 » Clustering by Random Projections |
163
click to vote
RECOMB
2001
Springer
16 years 6 hour ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
100
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
129
click to vote
MMM
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
113
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—CAN is a well-known DHT technique for contentbased P2P networks, where each node is assigned a zone in a virtual coordinate space to store the index of the data hashed i...