Sciweavers

137 search results - page 21 / 28
» On the number of local minima for the multidimensional assig...
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ACL
2007
13 years 9 months ago
Chinese Segmentation with a Word-Based Perceptron Algorithm
Standard approaches to Chinese word segmentation treat the problem as a tagging task, assigning labels to the characters in the sequence indicating whether the character marks a w...
Yue Zhang 0004, Stephen Clark
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 1 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
ICCV
2007
IEEE
14 years 9 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
14 years 8 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...