3122 search results - page 366 / 625 » Storing Semistructured Data with STORED |
149
click to vote
LREC
2010
15 years 8 months ago
2010
In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textua...
193
click to vote
IJCAI
2007
15 years 8 months ago
2007
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
199
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
184
click to vote
DMIN
2006
15 years 8 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
158
click to vote
ALENEX
2003
15 years 8 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...