Sciweavers

2283 search results - page 178 / 457
» Bounds of Graph Characteristics
Sort
View
TCOS
2010
13 years 6 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 17 hour ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
FOCS
2002
IEEE
14 years 1 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
TIT
2010
107views Education» more  TIT 2010»
13 years 3 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
CVPR
2012
IEEE
11 years 10 months ago
Learning to localize detected objects
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
Qieyun Dai, Derek Hoiem