Sciweavers

305 search results - page 30 / 61
» Using Answer Sets to Solve Belief Change Problems
Sort
View
ATAL
2006
Springer
15 years 3 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
CVPR
2009
IEEE
16 years 7 months ago
Visibility Constraints on Features of 3D Objects
To recognize three-dimensional objects it is important to model how their appearances can change due to changes in viewpoint. A key aspect of this involves understanding which o...
Ronen Basri, Pedro F. Felzenszwalb, Ross B. Girshi...
BMCBI
2008
97views more  BMCBI 2008»
14 years 12 months ago
Quantitative analysis of numerical solvers for oscillatory biomolecular system models
Background: This article provides guidelines for selecting optimal numerical solvers for biomolecular system models. Because various parameters of the same system could have drast...
Chang F. Quo, May D. Wang
GIS
2011
ACM
14 years 3 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira