1236 search results - page 19 / 248 » Prefix-Like Complexities and Computability in the Limit |
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
83
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
FQAS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The task of similarity search is widely used in various areas of computing, including multimedia databases, data mining, bioinformatics, social networks, etc. For a long ...