229 search results - page 24 / 46 » Speeding Up Two String-Matching Algorithms |
SIGGRAPH
2000
ACM
13 years 11 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
ICMCS
2006
IEEE
14 years 1 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...
SIROCCO
2010
13 years 9 months ago
2010
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
JVCA
2006
13 years 7 months ago
2006
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...