Sciweavers

1933 search results - page 297 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 3 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
CVPR
2007
IEEE
14 years 11 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
ICPR
2008
IEEE
14 years 3 months ago
Topologically correct surface reconstruction using alpha shapes and relations to ball-pivoting
The problem to reconstruct a surface given a finite set of boundary points is of growing interest, e.g. in the context of laser range images. While a lot of heuristic methods hav...
Peer Stelldinger
TSD
2007
Springer
14 years 3 months ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
GLOBECOM
2006
IEEE
14 years 3 months ago
Fast Packet Classification using Group Bit Vector
—Packet classification is important in fulfilling the requirements of new services such as policy-based routing in next generation networks. In this paper, we propose a novel bit...
Tong Liu, Huawei Li, Xiaowei Li, Yinhe Han