Sciweavers

11214 search results - page 106 / 2243
» Just-in-time data structures
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Linear discriminant analysis for data with subcluster structure
Linear discriminant analysis (LDA) is a widely-used feature extraction method in classification. However, the original LDA has limitations due to the assumption of a unimodal str...
Haesun Park, Jaegul Choo, Barry L. Drake, Jinwoo K...
ECML
2007
Springer
14 years 4 months ago
Optimizing Feature Sets for Structured Data
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
Ulrich Rückert, Stefan Kramer
ICALP
1999
Springer
14 years 2 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
RTA
2010
Springer
14 years 2 months ago
Proving Productivity in Infinite Data Structures
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
Hans Zantema, Matthias Raffelsieper
IIE
2007
56views more  IIE 2007»
13 years 10 months ago
Recursion Versus Iteration with the List as a Data Structure
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...
Izabella Foltynowicz