Sciweavers

23590 search results - page 4592 / 4718
» Algorithm Performance Contest
Sort
View
FOCS
1999
IEEE
15 years 9 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
SIGGRAPH
1999
ACM
15 years 9 months ago
Environment Matting and Compositing
This paper introduces a new process, environment matting, which captures not just a foreground object and its traditional opacity matte from a real-world scene, but also a descrip...
Douglas E. Zongker, Dawn M. Werner, Brian Curless,...
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
15 years 9 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli
ICIP
1999
IEEE
15 years 9 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
AGENTS
1999
Springer
15 years 9 months ago
A Personal News Agent That Talks, Learns and Explains
Most work on intelligent information agents has thus far focused on systems that are accessible through the World Wide Web. As demanding schedules prohibit people from continuous ...
Daniel Billsus, Michael J. Pazzani
« Prev « First page 4592 / 4718 Last » Next »