10988 search results - page 251 / 2198 » Algorithmic Folding Complexity |
151
click to vote
IJRR
2006
15 years 4 months ago
2006
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
252
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
128
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. While complex matchings ...
133
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
135
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...