Sciweavers

8196 search results - page 177 / 1640
» Computational Modeling and Complexity Science
Sort
View
FCT
2005
Springer
15 years 12 months ago
The Complexity of Querying External Memory and Streaming Data
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
Martin Grohe, Christoph Koch, Nicole Schweikardt
ACSC
2008
IEEE
16 years 28 days ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
ACSC
2002
IEEE
15 years 11 months ago
Bandwidth Reservation Strategies for Mobility Support of Wireless Connections with QoS Guarantees
This paper examines QoS guarantees for bandwidth in mobile wireless networks, with a focus on reducing dropped connections on handoff. We can achieve this by reserving bandwidth f...
R. Hutchens, S. Singh
STACS
1999
Springer
15 years 10 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
FOCS
1993
IEEE
15 years 10 months ago
Dynamic Word Problems
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...