Sciweavers

1055 search results - page 210 / 211
» Enumerations in computable structure theory
Sort
View
TIFS
2008
157views more  TIFS 2008»
13 years 7 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, ...
BMCBI
2005
116views more  BMCBI 2005»
13 years 7 months ago
WEBnm@: a web application for normal mode analyses of proteins
Background: Normal mode analysis (NMA) has become the method of choice to investigate the slowest motions in macromolecular systems. NMA is especially useful for large biomolecula...
Siv Midtun Hollup, Gisle Sælensminde, Nathal...
UMUAI
1998
119views more  UMUAI 1998»
13 years 7 months ago
COLLAGEN: A Collaboration Manager for Software Interface Agents
We have implemented an application-independent collaboration manager, called Collagen, based on the SharedPlan theory of discourse, and used it to build a software interface agent...
Charles Rich, Candace L. Sidner
PRL
2007
108views more  PRL 2007»
13 years 7 months ago
Towards a measure of deformability of shape sequences
In this paper we develop a theory for characterizing how deformable a shape is given a sequence of its observations. We define a term called ‘‘deformability index’’ (DI) ...
Amit K. Roy Chowdhury
ICDT
2010
ACM
137views Database» more  ICDT 2010»
13 years 6 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou