Sciweavers

7351 search results - page 1219 / 1471
» Segmenting Point Sets
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 7 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
16 years 7 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
VLSID
2002
IEEE
91views VLSI» more  VLSID 2002»
16 years 7 months ago
Rational ABCD Modeling of High-Speed Interconnects
This paper introduces a new numerical approximation technique, called the Differential Quadrature Method (DQM), in order to derive the rational ABCD matrix representing the high-s...
Qinwei Xu, Pinaki Mazumder
CHI
2004
ACM
16 years 7 months ago
Gooey interfaces: an approach for rapidly repurposing digital content
With the acceleration of technological development we are reaching the point where our systems and their user interfaces become to some degree outdated 'legacy systems' ...
Les Nelson, Elizabeth F. Churchill, Laurent Denoue...
CHI
2003
ACM
16 years 7 months ago
Reflowing digital ink annotations
Annotating paper documents with a pen is a familiar and indispensable activity across a wide variety of work and educational settings. Recent developments in pen-based computing p...
David Bargeron, Tomer Moscovich
« Prev « First page 1219 / 1471 Last » Next »