Sciweavers

8647 search results - page 127 / 1730
» The Container Selection Problem
Sort
View
APPROX
2010
Springer
193views Algorithms» more  APPROX 2010»
15 years 4 months ago
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
MohammadHossein Bateni, Julia Chuzhoy
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 3 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
CVPR
2005
IEEE
16 years 5 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
16 years 4 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...
ICPR
2008
IEEE
16 years 4 months ago
Counterfeit iris detection based on texture analysis
This paper addresses the issue of counterfeit iris detection, which is a liveness detection problem in biometrics. Fake iris mentioned here refers to iris wearing color contact le...
Tieniu Tan, Xianchao Qiu, Zhenan Sun, Zhuoshi Wei