Sciweavers

2836 search results - page 77 / 568
» Parsing Algorithms and Metrics
Sort
View
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 8 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
CVPR
2007
IEEE
14 years 10 months ago
Adaptive Distance Metric Learning for Clustering
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
Jieping Ye, Zheng Zhao, Huan Liu
EURODAC
1995
IEEE
128views VHDL» more  EURODAC 1995»
13 years 11 months ago
Closeness metrics for system-level functional partitioning
An important system design task is the partitioning of system functionality for implementation among multiple system components, including partitions among hardware and software c...
Frank Vahid, Daniel D. Gajski
BMVC
2010
13 years 5 months ago
StyP-Boost: A Bilinear Boosting Algorithm for Learning Style-Parameterized Classifiers
We introduce a novel bilinear boosting algorithm, which extends the multi-class boosting framework of JointBoost to optimize a bilinear objective function. This allows style param...
Jonathan Warrell, Philip H. S. Torr, Simon Prince
NSDI
2008
13 years 10 months ago
NetComplex: A Complexity Metric for Networked System Designs
The systems and networking community treasures "simple" system designs, but our evaluation of system simplicity often relies more on intuition and qualitative discussion...
Byung-Gon Chun, Sylvia Ratnasamy, Eddie Kohler