962 search results - page 71 / 193 » Efficient Algorithms for Eulerian Extension |
137
Voted
TWC
2010
14 years 10 months ago
2010
In this paper, we study the issue of scheduling transmission opportunities among nodes (peers) to achieve higher network throughput and lower transmission delay for network coding ...
141
click to vote
ICCV
2009
IEEE
16 years 9 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...
145
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
161
Voted
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
143
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...