Sciweavers

1159 search results - page 142 / 232
» Binary Decision Graphs
Sort
View
STACS
2009
Springer
16 years 9 days ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 11 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
156
Voted
3DPVT
2002
IEEE
150views Visualization» more  3DPVT 2002»
15 years 10 months ago
Coding with ASCII: compact, yet text-based 3D content
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed ...
Martin Isenburg, Jack Snoeyink
DEXA
2007
Springer
114views Database» more  DEXA 2007»
15 years 9 months ago
Data Management for Mobile Ajax Web 2.0 Applications
Whenever Ajax applications on mobile devices have to retrieve large XML data fragments from a remote server, a reduction of the exchanged data volume may be crucial to manage limit...
Stefan Böttcher, Rita Steinmetz
ICC
2007
IEEE
150views Communications» more  ICC 2007»
15 years 9 months ago
ACE Spectrum of LDPC Codes and Generalized ACE Design
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...