415 search results - page 34 / 83 » Optimally Reconstructing Weighted Graphs Using Queries |
EDBTW
2006
Springer
14 years 22 days ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution plan for a given query. Since the physical IO (PIO) is a costly operation to...
VLDB
2008
ACM
14 years 9 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...