Sciweavers

2412 search results - page 257 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
WABI
2010
Springer
170views Bioinformatics» more  WABI 2010»
15 years 2 months ago
Haplotypes versus Genotypes on Pedigrees
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...
Bonnie Kirkpatrick
CP
2010
Springer
15 years 2 months ago
An Integrated Business Rules and Constraints Approach to Data Centre Capacity Management
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
Roman van der Krogt, Jacob Feldman, James Little, ...
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 4 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
15 years 10 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
ICRA
2007
IEEE
122views Robotics» more  ICRA 2007»
15 years 10 months ago
Exploiting the Information at the Loop Closure in SLAM
— This paper presents two methods able to exploit the information at the loop closure in the SLAM problem. Both methods have three fundamental advantages. The first one is that ...
Agostino Martinelli, Roland Siegwart