Sciweavers

3913 search results - page 403 / 783
» complexity 2006
Sort
View
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
15 years 10 months ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin
DATE
2006
IEEE
97views Hardware» more  DATE 2006»
15 years 10 months ago
Monolithic verification of deep pipelines with collapsed flushing
We introduce collapsed flushing, a new flushing-based refinement map for automatically verifying safety and liveness properties of term-level pipelined machine models. We also pre...
Roma Kane, Panagiotis Manolios, Sudarshan K. Srini...
DCOSS
2006
Springer
15 years 10 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...
DEXA
2006
Springer
80views Database» more  DEXA 2006»
15 years 10 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
DIS
2006
Springer
15 years 10 months ago
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
Taneli Mielikäinen, Pance Panov, Saso Dzerosk...