6274 search results - page 115 / 1255 » From query complexity to computational complexity |
106
click to vote
MCU
2007
15 years 5 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
147
click to vote
SMA
2008
ACM
15 years 3 months ago
2008
ACM
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
152
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
119
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
116
Voted
PERCOM
2008
ACM
16 years 3 months ago
2008
ACM
This paper identifies requirements for querying and accessing context information in mobile and pervasive computing environments. Furthermore it studies existing query languages s...