Sciweavers

15073 search results - page 2570 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 11 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ICS
2009
Tsinghua U.
15 years 10 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
159
Voted
ICCV
1999
IEEE
15 years 10 months ago
What Can Be Determined from a Full and a Weak Perspective Image?
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
Zhengyou Zhang, P. Anandan, Heung-Yeung Shum
RAID
1999
Springer
15 years 10 months ago
Audit logs: to keep or not to keep?
We approached this line of inquiry by questioning the conventional wisdom that audit logs are too large to be analyzed and must be reduced and filtered before the data can be anal...
Christopher Wee
SIGGRAPH
1997
ACM
15 years 10 months ago
Adapting simulated behaviors for new characters
This paper describes an algorithm for automatically adapting existing simulated behaviors to new characters. Animating a new character is difficult because a control system tuned...
Jessica K. Hodgins, Nancy S. Pollard
« Prev « First page 2570 / 3015 Last » Next »