Sciweavers

8780 search results - page 150 / 1756
» On the Feasibility of Consistent Computations
Sort
View
HPDC
2000
IEEE
15 years 11 months ago
QoS and Contention-Aware Multi-Resource Reservation
To provide Quality of Service (QoS) guarantee in distributed services, it is necessary to reserve multiple computing and communication resources for each service session. Meanwhile...
Dongyan Xu, Klara Nahrstedt, Arun Viswanathan, Dua...
BMCBI
2008
122views more  BMCBI 2008»
15 years 7 months ago
High-throughput bioinformatics with the Cyrille2 pipeline system
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
Mark W. E. J. Fiers, Ate van der Burgt, Erwin Date...
CP
2008
Springer
15 years 8 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
GC
2002
Springer
15 years 6 months ago
The Chromatic Spectrum of Mixed Hypergraphs
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Vol...
214
Voted
EUROCRYPT
2003
Springer
16 years 8 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