Sciweavers

59 search results - page 4 / 12
» Generalized Semi-Infinite Programming: on generic local mini...
Sort
View
ACSD
2009
IEEE
149views Hardware» more  ACSD 2009»
14 years 2 months ago
From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations
We propose a general method to characterize and synthesize correctness-preserving, asynchronous wrappers for synchronous processes on a globally asynchronous locally synchronous (...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
PODS
2008
ACM
158views Database» more  PODS 2008»
14 years 7 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
CP
2006
Springer
13 years 11 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
ICIP
2010
IEEE
13 years 5 months ago
A concave cost formulation for parametric curve fitting: Detection of leukocytes from intravital microscopy images
We formulate parametric curve fitting as a concave cost minimization problem. Our formulation is general encompassing any parametric curve where parameters can be free or constrai...
Nilanjan Ray