Sciweavers

397 search results - page 49 / 80
» Inversion in Time
Sort
View
KES
2005
Springer
14 years 3 months ago
Feature Generation by Simple FLD
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
Minoru Fukumi, Yasue Mitsukura
CGI
2000
IEEE
14 years 2 months ago
Fast and Stable Animation of Cloth with an Approximated Implicit Method
Realistic animation of soft objects such as cloth is essential for plausible character animation. Many techniques have been proposed for the simulation of soft objects, and most o...
Young-Min Kang, Jeong-Hyeon Choi, Hwan-Gue Cho, Ch...
STACS
1992
Springer
14 years 1 months ago
A Simplified Technique for Hidden-Line Elimination in Terrains
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Franco P. Preparata, Jeffrey Scott Vitter
DAS
2006
Springer
14 years 1 months ago
Combining Multiple Classifiers for Faster Optical Character Recognition
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 11 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons