Sciweavers

6978 search results - page 1208 / 1396
» On Proofs in System P
Sort
View
SIGGRAPH
1997
ACM
14 years 1 months ago
A framework for realistic image synthesis
Our goal is to develop physically based lighting models and perceptually based rendering procedures for computer graphics that will produce synthetic images that are visually and ...
Donald P. Greenberg, Kenneth E. Torrance, Peter Sh...
INFOCOM
1989
IEEE
14 years 1 months ago
An Efficient Multiple-Access Method for the Binary Adder Channel
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
Israel Bar-David, Eli Plotnik, Raphael Rom
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 11 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
NIPS
1998
13 years 11 months ago
Modeling Surround Suppression in V1 Neurons with a Statistically Derived Normalization Model
We examine the statistics of natural monochromatic images decomposed using a multi-scale wavelet basis. Although the coefficients of this representation are nearly decorrelated, t...
Eero P. Simoncelli, Odelia Schwartz
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 11 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
« Prev « First page 1208 / 1396 Last » Next »