415 search results - page 45 / 83 » Optimally Reconstructing Weighted Graphs Using Queries |
IWPC
2000
IEEE
14 years 1 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
SBBD
2004
13 years 10 months ago
2004
Web search engines compete to offer the fastest responses with highest relevance. However, as Web collections grow, it becomes more difficult to achieve this purpose. As most user...
3DIM
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
ICIP
2005
IEEE
14 years 2 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
SIGIR
2011
ACM
12 years 12 months ago
2011
ACM
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...