595 search results - page 48 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
152
Voted
ISVC
2009
Springer
15 years 8 months ago
2009
Springer
Foregrounds extracted from the background, which are intended to be used as photorealistic avatars for simulators in a variety of virtual worlds, should satisfy the following four ...
163
Voted
ICTAI
2009
IEEE
15 years 1 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
129
Voted
ICS
1999
Tsinghua U.
15 years 7 months ago
1999
Tsinghua U.
The Virtual Interface (VI) Architecture provides protected userlevel communication with high delivered bandwidth and low permessage latency, particularly for small messages. The V...
113
click to vote
LCPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
128
Voted
CDB
2004
Springer
15 years 8 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....