Sciweavers

57 search results - page 9 / 12
» Probabilistic graph and hypergraph matching
Sort
View
CVIU
2008
188views more  CVIU 2008»
13 years 7 months ago
Learning function-based object classification from 3D imagery
We propose a novel scheme for using supervised learning for function-based classification of objects in 3D images. During the learning process, a generic multi-level hierarchical ...
Michael Pechuk, Octavian Soldea, Ehud Rivlin
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 9 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
13 years 9 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...