Sciweavers

1161 search results - page 131 / 233
» Approximation schemes for clustering problems
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
DAC
2009
ACM
14 years 11 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
CLUSTER
2004
IEEE
14 years 1 months ago
Towards provision of quality of service guarantees in job scheduling
Considerable research has focused on the problem of scheduling dynamically arriving independent parallel jobs on a given set of resources. There has also been some recent work in ...
Mohammad Islam, Pavan Balaji, P. Sadayappan, Dhaba...
TNN
1998
146views more  TNN 1998»
13 years 9 months ago
Fuzzy lattice neural network (FLNN): a hybrid model for learning
— This paper proposes two hierarchical schemes for learning, one for clustering and the other for classification problems. Both schemes can be implemented on a fuzzy lattice neu...
Vassilios Petridis, Vassilis G. Kaburlasos
CVPR
2003
IEEE
15 years 2 days ago
Video-Based Face Recognition Using Probabilistic Appearance Manifolds
This paper presents a novel method to model and recognize human faces in video sequences. Each registered person is represented by a low-dimensional appearance manifold in the amb...
Kuang-Chih Lee, Jeffrey Ho, Ming-Hsuan Yang, David...