Sciweavers

895 search results - page 25 / 179
» Using graphs for some discrete tomography problems
Sort
View
CVIU
2007
125views more  CVIU 2007»
14 years 9 months ago
Graph regularization for color image processing
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
Olivier Lezoray, Abderrahim Elmoataz, Sébas...
RSS
2007
147views Robotics» more  RSS 2007»
14 years 11 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 4 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...
AAAI
1998
14 years 11 months ago
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
Fahiem Bacchus, Peter van Beek
WWW
2009
ACM
15 years 10 months ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul