Sciweavers

7628 search results - page 1312 / 1526
» Spatial P systems
Sort
View
SIGGRAPH
1997
ACM
15 years 10 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
15 years 10 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»
15 years 8 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
BMCBI
2010
149views more  BMCBI 2010»
15 years 6 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
CN
2008
117views more  CN 2008»
15 years 6 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
« Prev « First page 1312 / 1526 Last » Next »