Sciweavers

674 search results - page 99 / 135
» Arguments and Results
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 2 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
CSB
2003
IEEE
14 years 1 months ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
EDOC
2003
IEEE
14 years 1 months ago
MQL: a Powerful Extension to OCL for MOF Queries
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
David Hearnden, Kerry Raymond, Jim Steel
INFOCOM
2003
IEEE
14 years 1 months ago
On-line Tuning of Prices for Network Services
— Recent investigations into the pricing of multiclass loss networks have shown that static prices are optimal in the asymptotic regime of many small sources. These results sugge...
Enrique Campos-Náñez, Stephen D. Pat...