Sciweavers

1604 search results - page 77 / 321
» Approximation algorithms for developable surfaces
Sort
View
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
14 years 24 days ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
EOR
2007
76views more  EOR 2007»
13 years 9 months ago
Multicriteria tour planning for mobile healthcare facilities in a developing country
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
Karl Doerner, Axel Focke, Walter J. Gutjahr
ICCV
2005
IEEE
14 years 11 months ago
Can Two Specular Pixels Calibrate Photometric Stereo?
Lambertian photometric stereo with unknown light source parameters is ambiguous. Provided that the object imaged constitutes a surface, the ambiguity is represented by the group o...
Ondrej Drbohlav, Mike J. Chantler
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
14 years 9 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
FOCS
2004
IEEE
14 years 20 days ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...