13603 search results - page 367 / 2721 » On the Computational Complexity of Cut-Reduction |
200
click to vote
MOBIHOC
2006
ACM
16 years 7 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
198
click to vote
VMCAI
2005
Springer
16 years 1 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
200
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
224
click to vote
PODC
2006
ACM
16 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
196
click to vote
ISCAS
2005
IEEE
16 years 1 months ago
2005
IEEE
The H.264 adopts various block types and multiple reference frames for motion compensation. For transcoding a video sequence from the H.263 format to the H.264 format, it is benef...