Sciweavers

966 search results - page 113 / 194
» Global Optimization of Compositional Systems
Sort
View
ICML
2009
IEEE
15 years 10 months ago
Learning when to stop thinking and do something!
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
Barnabás Póczos, Csaba Szepesv&aacut...
PSIVT
2009
Springer
252views Multimedia» more  PSIVT 2009»
15 years 2 months ago
Moving Object Segmentation Using Optical Flow and Depth Information
This paper discusses the detection of moving objects (being a crucial part of driver assistance systems) using monocular or stereoscopic computer vision. In both cases, object dete...
Jens Klappstein, Tobi Vaudrey, Clemens Rabe, Andre...
VLDB
1998
ACM
138views Database» more  VLDB 1998»
15 years 2 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang
NIPS
2001
14 years 11 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
BMCBI
2005
89views more  BMCBI 2005»
14 years 9 months ago
An empirical analysis of training protocols for probabilistic gene finders
Background: Generalized hidden Markov models (GHMMs) appear to be approaching acceptance as a de facto standard for state-of-the-art ab initio gene finding, as evidenced by the re...
William H. Majoros, Steven Salzberg