10988 search results - page 1830 / 2198 » Algorithmic Folding Complexity |
200
Voted
COLT
2007
Springer
16 years 1 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
187
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
195
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
185
click to vote
DCOSS
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
215
click to vote
DNA
2007
Springer
16 years 1 months ago
2007
Springer
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...