3941 search results - page 112 / 789 » Computational Efficiency of Batching Methods |
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
PR
2006
13 years 10 months ago
2006
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...
RECOMB
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. So far, most methods for identifying sequences under selection based on comparative sequence data have either assumed selectional pressures are the same across all branch...
DAC
1996
ACM
14 years 2 months ago
1996
ACM
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
ICPR
2010
IEEE
14 years 3 days ago
2010
IEEE
Canonical correlation analysis (CCA) is a powerful tool for analyzing multi-dimensional paired data. However, CCA tends to perform poorly when the number of paired samples is limit...