Sciweavers

1922 search results - page 249 / 385
» ie 2007
Sort
View
186
Voted
CP
2007
Springer
16 years 1 months ago
Path Consistency by Dual Consistency
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
Christophe Lecoutre, Stéphane Cardon, Julie...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
CSR
2007
Springer
16 years 1 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
DAMON
2007
Springer
16 years 1 months ago
Vectorized data processing on the cell broadband engine
In this work, we research the suitability of the Cell Broadband Engine for database processing. We start by outlining the main architectural features of Cell and use microbenchmar...
Sándor Héman, Niels Nes, Marcin Zuko...
DCOSS
2007
Springer
16 years 1 months ago
Localization for Anchoritic Sensor Networks
We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or...
Yuliy M. Baryshnikov, Jian Tan