1541 search results - page 203 / 309 » Analysis of Random Noise and Random Walk Algorithms |
DAGM
2005
Springer
14 years 1 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...
CLEF
2010
Springer
13 years 9 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 ...
ICWSM
2009
13 years 6 months 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...
STOC
1996
ACM
14 years 10 days 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...
CIAC
2006
Springer
13 years 12 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...