11212 search results - page 353 / 2243 » Semi-persistent Data Structures |
193
Voted
GFKL
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
147
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
146
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Prediction error identification requires that data be informative with respect to the chosen model structure. Whereas sufficient conditions for informative experiments have been av...
183
click to vote
AAAI
2006
15 years 8 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
161
click to vote
ACL
2006
15 years 8 months ago
2006
Transforming syntactic representations in order to improve parsing accuracy has been exploited successfully in statistical parsing systems using constituency-based representations...