466 search results - page 59 / 94 » RAIN: data clustering using randomized interactions between ... |
173
click to vote
PRESENCE
2006
15 years 4 months ago
2006
This paper describes two methods for analyzing interactions in collaborative virtual environments (CVEs): one whereby quantitative data are captured, interaction is categorized in...
148
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...
156
Voted
VTC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--In this paper we analyze the energy-efficiency of distributed compression and its dependence on the node deployment strategies for Wireless Sensor Networks (WSNs). Reduce...
177
Voted
NIPS
2004
15 years 6 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
141
click to vote
RECOMB
2007
Springer
16 years 5 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...