233 search results - page 35 / 47 » An Investigation of Practical Approximate Nearest Neighbor A... |
115
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
119
click to vote
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
COCOON
2010
Springer
15 years 5 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
98
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
103
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...