Sciweavers

5595 search results - page 297 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
186
Voted
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
15 years 11 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
FGR
2006
IEEE
217views Biometrics» more  FGR 2006»
16 years 22 days ago
Face Recognition with Image Sets Using Hierarchically Extracted Exemplars from Appearance Manifolds
An unsupervised nonparametric approach is proposed to automatically extract representative face samples (exemplars) from a video sequence or an image set for multipleshot face rec...
Wei Fan, Dit-Yan Yeung
VISUALIZATION
1999
IEEE
15 years 11 months ago
Construction of Vector Field Hierarchies
We present a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The inpu...
Bjørn Heckel, Gunther H. Weber, Bernd Haman...
MASCOTS
2010
15 years 5 months ago
Cluster-Based Correlated Data Gathering in Wireless Sensor Networks
—We consider the problem of optimal cluster-based data gathering in Wireless Sensor Networks (WSNs) when nearby readings are spatially correlated. Due to the dense nature of WSNs...
Ali Dabirmoghaddam, Majid Ghaderi, Carey L. Willia...
ICASSP
2010
IEEE
15 years 6 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...