Sciweavers

779 search results - page 125 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 12 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
CVPR
2007
IEEE
16 years 1 months ago
ShadowCuts: Photometric Stereo with Shadows
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
16 years 7 days ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
15 years 6 months ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
COLT
1995
Springer
15 years 3 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld