Sciweavers

1977 search results - page 77 / 396
» The satisfactory partition problem
Sort
View
TC
1998
15 years 5 months ago
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
Greg Gravenstreter, Rami G. Melhem
TPDS
2002
136views more  TPDS 2002»
15 years 5 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
ICASSP
2011
IEEE
14 years 9 months ago
Multi-sensor PHD: Construction and implementation by space partitioning
The Probability Hypothesis Density (PHD) is a well-known method for single-sensor multi-target tracking problems in a Bayesian framework, but the extension to the multi-sensor cas...
Emmanuel Delande, Emmanuel Duflos, Philippe Vanhee...
VLDB
2007
ACM
109views Database» more  VLDB 2007»
16 years 6 months ago
FluxCapacitor: Efficient Time-Travel Text Search
An increasing number of temporally versioned text collections is available today with Web archives being a prime example. Search on such collections, however, is often not satisfa...
Klaus Berberich, Srikanta J. Bedathur, Thomas Neum...
FDTC
2009
Springer
191views Cryptology» more  FDTC 2009»
16 years 18 days ago
Protecting RSA against Fault Attacks: The Embedding Method
—Fault attacks constitute a major threat toward cryptographic products supporting RSA-based technologies. Most often, the public exponent is unknown, turning resistance to fault ...
Marc Joye