4047 search results - page 237 / 810 » The Discrete Basis Problem |
140
click to vote
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
124
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
117
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
Many computer vision applications such as image filtering, segmentation and stereo-vision can be formulated as optimization problems.Whereas in previous decades continuousdomain, ...
158
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
Robust, real-time tracking of objects from visual data requires probabilistic fusion of multiple visual cues. Previous approaches have either been ad hoc or relied on a Bayesian n...
151
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...