6568 search results - page 952 / 1314 » Reducing the Complexity of Reductions |
203
click to vote
CC
1998
Springer
15 years 6 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
193
click to vote
JGAA
2002
15 years 6 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
209
click to vote
WICOMM
2008
15 years 6 months ago
2008
With the recent advances in portable devices and wireless networks, a new paradigm of computing has emerged which is known as mobile computing. In general mobile computing can be ...
222
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Low-dimensional topic models have been proven very useful for modeling a large corpus of documents that share a relatively small number of topics. Dimensionality reduction tools s...
208
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...