Sciweavers

2497 search results - page 353 / 500
» Requirements for models of achievable routing
Sort
View
179
Voted
INFOCOM
2005
IEEE
16 years 13 days ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
SMA
2005
ACM
104views Solid Modeling» more  SMA 2005»
16 years 12 days ago
Packing a trunk: now with a twist!
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk...
Friedrich Eisenbrand, Stefan Funke, Andreas Karren...
CDVE
2005
Springer
245views Visualization» more  CDVE 2005»
16 years 11 days ago
Collaborative Solution for Cooperation, Coordination and Knowledge Management in the Ceramic Tile Design Chain
This paper presents a solution for cooperation between companies that belong to a supply chain in the ceramic tile sector, where competitiveness requires constant innovation in pro...
Carlos Vila, Fernando Romero, Vanesa Galmés...
IBPRIA
2005
Springer
16 years 11 days ago
Robust Person-Independent Visual Sign Language Recognition
Sign language recognition constitutes a challenging field of research in computer vision. Common problems like overlap, ambiguities, and minimal pairs occur frequently and require...
Jörg Zieren, Karl-Friedrich Kraiss
EUROCRYPT
2004
Springer
16 years 7 days ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz