2127 search results - page 221 / 426 » Computing large matchings fast |
145
click to vote
NIPS
2003
15 years 6 months ago
2003
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
103
click to vote
COR
2006
15 years 4 months ago
2006
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heurist...
150
click to vote
INFORMATICALT
2010
15 years 1 months ago
2010
Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptograp...
111
click to vote
WECWIS
2003
IEEE
15 years 10 months ago
2003
IEEE
Markets with time dependent goods are special cases of multi commodity markets.The design of large flexible markets with time dependent goods is a computational challenge. In thi...
120
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...