Sciweavers

5595 search results - page 767 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 10 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
SBBD
2000
168views Database» more  SBBD 2000»
15 years 8 months ago
Fast Feature Selection Using Fractal Dimension
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
Caetano Traina Jr., Agma J. M. Traina, Leejay Wu, ...
203
Voted
CSDA
2008
128views more  CSDA 2008»
15 years 6 months ago
On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been successfully applied to document clustering recently. In this paper, we show th...
Chris H. Q. Ding, Tao Li, Wei Peng
CGF
2010
165views more  CGF 2010»
15 years 5 months ago
Hierarchical Structure Recovery of Point-Sampled Surfaces
We focus on the class of regular models defined by Várady et al. for reverse engineering purposes. Given a 3D surface M represented through a dense set of points, we present a n...
Marco Attene, Giuseppe Patanè
ICCAD
1994
IEEE
151views Hardware» more  ICCAD 1994»
15 years 11 months ago
Multi-way VLSI circuit partitioning based on dual net representation
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propo...
Jason Cong, Wilburt Labio, Narayanan Shivakumar