Sciweavers

8810 search results - page 1581 / 1762
» Openness
Sort
View
192
Voted
SAC
2000
ACM
15 years 9 months ago
The Mobile Agent Technology to Support and to Access Museum Information
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
Paolo Bellavista, Antonio Corradi, Andrea Tomasi
144
Voted
SIGMOD
2000
ACM
99views Database» more  SIGMOD 2000»
15 years 9 months ago
WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web
We present WSQ/DSQ (pronounced “wisk-disk”), a new approach for combining the query facilities of traditional databases with existing search engines on the Web. WSQ, for Web-S...
Roy Goldman, Jennifer Widom
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 9 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
151
Voted
ASIACRYPT
2000
Springer
15 years 9 months ago
Towards Signature-Only Signature Schemes
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...
Adam Young, Moti Yung
153
Voted
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
15 years 9 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
« Prev « First page 1581 / 1762 Last » Next »