Sciweavers

653 search results - page 73 / 131
» Efficient reconstruction from non-uniform point sets
Sort
View
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 4 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
CIKM
2009
Springer
15 years 3 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
CW
2002
IEEE
15 years 4 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
APLAS
2007
ACM
15 years 3 months ago
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
Neil D. Jones, René Rydhof Hansen
KAIS
2000
131views more  KAIS 2000»
14 years 11 months ago
Intentions in the Coordinated Generation of Graphics and Text from Tabular Data
To use graphics efficiently in an automatic report generation system, one has to model messages and how they go from the writer (intention) to the reader (interpretation). This pap...
Massimo Fasciano, Guy Lapalme