6274 search results - page 443 / 1255 » From query complexity to computational complexity |
205
Voted
STACS
2005
Springer
16 years 10 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
186
Voted
BMCBI
2010
15 years 7 months ago
2010
Background: Single nucleotide polymorphism (SNP) based association studies aim at identifying SNPs associated with phenotypes, for example, complex diseases. The associated SNPs m...
229
Voted
IUI
2009
ACM
16 years 3 months ago
2009
ACM
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
196
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— For many tasks in populated environments, robots need to keep track of present and future motion states of people. Most approaches to people tracking make weak assumpti...
243
Voted
IMC
2010
ACM
15 years 4 months ago
2010
ACM
This paper presents a new approach to determine the geographical footprint of individual Autonomous Systems that directly provide service to end-users, i.e.,eyeball ASes. The key ...