1541 search results - page 203 / 309 » Analysis of Random Noise and Random Walk Algorithms |
149
click to vote
DAGM
2005
Springer
15 years 8 months ago
2005
Springer
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...
147
click to vote
CLEF
2010
Springer
15 years 4 months ago
2010
Springer
Wikipedia describes itself as the "free encyclopedia that anyone can edit". Along with the helpful volunteers who contribute by improving the articles, a great number of ...
147
click to vote
ICWSM
2009
15 years 27 days ago
2009
A particularly challenging task for recommender systems (RSs) is deciding whether to recommend an item that received a variety of high and low scores from its users. RSs that inco...
142
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
132
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...