Sciweavers

5244 search results - page 28 / 1049
» When are two algorithms the same
Sort
View
IOR
2007
65views more  IOR 2007»
13 years 7 months ago
A Comparison of the Optimal Costs of Two Canonical Inventory Systems
We compare two inventory systems, one in which excess demand is lost and the other in which excess demand is backordered. Both systems are reviewed periodically. They experience t...
Ganesh Janakiraman, Sridhar Seshadri, J. George Sh...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 1 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
3DPVT
2006
IEEE
257views Visualization» more  3DPVT 2006»
14 years 1 months ago
3D from Line Segments in Two Poorly-Textured, Uncalibrated Images
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
Herbert Bay, Andreas Ess, Alexander Neubeck, Luc J...
ISAAC
2004
Springer
114views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
RNA is generally a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA mole...
Markus Bauer, Gunnar W. Klau
EUROCRYPT
2003
Springer
14 years 26 days ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell