Sciweavers

200 search results - page 37 / 40
» Projective mad families
Sort
View
COMPGEOM
2010
ACM
14 years 14 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
ICCBR
2001
Springer
13 years 12 months ago
Case-Based Reasoning in the Care of Alzheimer's Disease Patients
Abstract. Planning the ongoing care of Alzheimer's Disease (AD) patients is a complex task, marked by cases that change over time, multiple perspectives, and ethical issues. G...
Cynthia R. Marling, Peter Whitehouse
SIGGRAPH
1993
ACM
13 years 11 months ago
Wavelet radiosity
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
Steven J. Gortler, Peter Schröder, Michael F....
ASPLOS
1987
ACM
13 years 11 months ago
Machine-Independent Virtual Memory Management for Paged Uniprocessor and Multiprocessor Architectures
This paper describes the design and implementation of virtual memory management within the CMU Mach Operating System and the experiences gained by the Mach kernel group in porting...
Richard F. Rashid, Avadis Tevanian, Michael Young,...
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 9 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe