6020 search results - page 859 / 1204 » A New Approach to Model Counting |
162
click to vote
LCTRTS
2004
Springer
16 years 15 hour ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
178
click to vote
MICAI
2004
Springer
16 years 13 hour ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
140
click to vote
VLDB
2004
ACM
16 years 2 hour ago
2004
ACM
In this paper, we address the maintenance of spatial semijoin queries over continuously moving points, where points are modeled as linear functions of time. This is analogous to t...
153
click to vote
CSB
2003
IEEE
15 years 12 months ago
2003
IEEE
A new and essentially simple method to reconstruct prokaryotic phylogenetic trees from their complete genome data without using sequence alignment is proposed. It is based on the ...
175
click to vote
ITCC
2003
IEEE
15 years 12 months ago
2003
IEEE
: Motion is an important cue for many applications. Here we propose a solution for estimating motion from a sequence of images using three algorithms, viz., Batch, Recursive and Bo...