Sciweavers

834 search results - page 60 / 167
» A Decomposition Technique for Max-CSP
Sort
View
PODC
2010
ACM
14 years 1 days ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
CVPR
2003
IEEE
15 years 3 days ago
Simultaneous Structure and Texture Image Inpainting
An algorithm for the simultaneous filling-in of texture and structure in regions of missing image information is presented in this paper. The basic idea is to first decompose the ...
Guillermo Sapiro, Luminita A. Vese, Marcelo Bertal...
CVPR
2004
IEEE
15 years 3 days ago
Linear Projection Methods in Face Recognition under Unconstrained Illuminations: A Comparative Study
Face recognition under unconstrained illuminations (FR/I) received extensive study because of the existence of illumination subspace. [2] presented a study on the comparison betwe...
Qi Li, Jieping Ye, Chandra Kambhamettu
AI
1999
Springer
13 years 9 months ago
Modal Logics, Description Logics and Arithmetic Reasoning
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
Hans Jürgen Ohlbach, Jana Koehler
JCNS
2010
100views more  JCNS 2010»
13 years 8 months ago
Morphologically accurate reduced order modeling of spiking neurons
Accurately simulating neurons with realistic morphological structure and synaptic inputs requires the solution of large systems of nonlinear ordinary differential equations. We ap...
Anthony R. Kellems, Saifon Chaturantabut, Danny C....