Sciweavers

20441 search results - page 3609 / 4089
» Locally Computable Structures
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 9 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
198
Voted
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 9 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ACCV
2009
Springer
15 years 9 months ago
People Tracking and Segmentation Using Efficient Shape Sequences Matching
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
Junqiu Wang, Yasushi Yagi, Yasushi Makihara
GRAPHITE
2007
ACM
15 years 9 months ago
Appearance preserving octree-textures
Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in...
Julien Lacoste, Tamy Boubekeur, Bruno Jobard, Chri...
CONCUR
2000
Springer
15 years 8 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
« Prev « First page 3609 / 4089 Last » Next »