Sciweavers

187 search results - page 19 / 38
» Structural Results For Planar Sets With Many Similar Subsets
Sort
View
SMA
2005
ACM
131views Solid Modeling» more  SMA 2005»
15 years 5 months ago
Manifold splines
Constructing splines whose parametric domain is an arbitrary manifold and effectively computing such splines in realworld applications are of fundamental importance in solid and ...
Xianfeng Gu, Ying He 0001, Hong Qin
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 1 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
BMCBI
2007
128views more  BMCBI 2007»
14 years 11 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
ISCI
2008
116views more  ISCI 2008»
14 years 11 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
TIFS
2008
157views more  TIFS 2008»
14 years 11 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...