Sciweavers

715 search results - page 51 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
14 years 9 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
ICMCS
2006
IEEE
149views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Semantic 3D Face Mesh Simplification for Transmission and Visualization
Three-dimensional data generated from range scanners is usually composed of a huge amount of information. Simplification and compression techniques must be adopted in order to red...
Alessandro Colombo, Claudio Cusano, Raimondo Schet...
DCC
2002
IEEE
14 years 8 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
ACL
2007
13 years 10 months ago
Generating Constituent Order in German Clauses
We investigate the factors which determine constituent order in German clauses and propose an algorithm which performs the task in two steps: First, the best candidate for the ini...
Katja Filippova, Michael Strube
CW
2002
IEEE
14 years 1 months ago
Direct Segmentation for Reverse Engineering
In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate co...
Marek Vanco, Guido Brunnett