1096 search results - page 43 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present a new speaker diarization system that improves the accuracy of traditional hierarchical clustering-based methods with little increase in computational co...
BMCBI
2010
14 years 10 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
ATAL
2011
Springer
13 years 9 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
NIPS
2008
14 years 11 months ago
2008
The essence of exploration is acting to try to decrease uncertainty. We propose a new methodology for representing uncertainty in continuous-state control problems. Our approach, ...
AIIA
2007
Springer
14 years 11 months ago
2007
Springer
We have recently presented CarpeDiem, an algorithm that can be used for speeding up the evaluation of Supervised Sequential Learning (SSL) classifiers. CarpeDiem provides impress...