Sciweavers

811 search results - page 124 / 163
» Avoiding Approximate Squares
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
ICML
2005
IEEE
14 years 9 months ago
Multimodal oriented discriminant analysis
Linear discriminant analysis (LDA) has been an active topic of research during the last century. However, the existing algorithms have several limitations when applied to visual d...
Fernando De la Torre, Takeo Kanade
CADE
2008
Springer
14 years 9 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 9 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher