Sciweavers

142 search results - page 19 / 29
» Computing Maximum-Scoring Segments in Almost Linear Time
Sort
View
SIGGRAPH
2003
ACM
14 years 1 months ago
Learning controls for blend shape based realistic facial animation
Blend shape animation is the method of choice for keyframe facial animation: a set of blend shapes (key facial expressions) are used to define a linear space of facial expression...
Pushkar Joshi, Wen C. Tien, Mathieu Desbrun, Frede...
VLSISP
2010
205views more  VLSISP 2010»
13 years 6 months ago
Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
13 years 10 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
IR
2008
13 years 8 months ago
Output-sensitive autocompletion search
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
STACS
2010
Springer
14 years 3 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall