Sciweavers

625 search results - page 115 / 125
» On one algorithm for solving the problem of source function ...
Sort
View
ICALP
2010
Springer
14 years 15 days ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
BC
1998
111views more  BC 1998»
13 years 7 months ago
How to "hear" visual disparities: real-time stereoscopic spatial depth analysis using temporal resonance
Abstract. In a stereoscopic system, both eyes or cameras have a slightly di€erent view. As a consequence, small variations between the projected images exist (`disparities') ...
Bernd Porr, Alex Cozzi, Florentin Wörgöt...
SIGMOD
2010
ACM
598views Database» more  SIGMOD 2010»
14 years 16 days ago
Ricardo: integrating R and Hadoop
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
Sudipto Das, Yannis Sismanis, Kevin S. Beyer, Rain...
SIGGRAPH
1997
ACM
13 years 12 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 7 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma