1099 search results - page 191 / 220 » On the Complexity of Computing Evolutionary Trees |
DAGM
2003
Springer
15 years 3 months ago
2003
Springer
Recently Viola et al. have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce and empirically analysis ...
HIPEAC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
118
click to vote
DIS
2007
Springer
15 years 1 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
EWCBR
2008
Springer
14 years 11 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...