Sciweavers

4513 search results - page 727 / 903
» Logic programming with satisfiability
Sort
View
CVPR
2006
IEEE
16 years 5 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi
137
Voted
ICSE
2008
IEEE-ACM
16 years 4 months ago
Juzi: a tool for repairing complex data structures
This paper describes Juzi, a tool for automatic repair of complex data structures. Juzi takes a Java class representing the data structure as well as a predicate method that speci...
Bassem Elkarablieh, Sarfraz Khurshid
ICALP
2009
Springer
16 years 3 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
133
Voted
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 3 months ago
Generating code for holistic query evaluation
We present the application of customized code generation to database query evaluation. The idea is to use a collection of highly efficient code templates and dynamically instantiat...
Konstantinos Krikellas, Marcelo Cintra, Stratis Vi...
126
Voted
MOBIHOC
2002
ACM
16 years 3 months ago
Algorithmic aspects of topology control problems for ad hoc networks
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ra...