Sciweavers

16596 search results - page 3176 / 3320
» Generalized Assignment Problems
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 8 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
WWW
2010
ACM
15 years 8 months ago
Access: news and blog analysis for the social sciences
The social sciences strive to understand the political, social, and cultural world around us, but have been impaired by limited access to the quantitative data sources enjoyed by ...
Mikhail Bautin, Charles B. Ward, Akshay Patil, Ste...
3DIM
1999
IEEE
15 years 8 months ago
Large Data Sets and Confusing Scenes in 3-D Surface Matching and Recognition
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
Owen T. Carmichael, Daniel F. Huber, Martial Heber...
SI3D
1999
ACM
15 years 8 months ago
Interactive technical illustration
A rendering is an abstraction that favors, preserves, or even emphasizes some qualities while sacrificing, suppressing, or omitting other characteristics that are not the focus o...
Bruce Gooch, Peter-Pike J. Sloan, Amy Gooch, Peter...
SIGGRAPH
1999
ACM
15 years 8 months ago
Direct Illumination with Lazy Visibility Evaluation
In this paper we present a technique for computing the direct lighting in a three-dimensional scene containing area light sources. Our method correctly handles partial visibility ...
David Hart, Philip Dutré, Donald P. Greenbe...
« Prev « First page 3176 / 3320 Last » Next »