Sciweavers

2485 search results - page 397 / 497
» Time Bounded Frequency Computations
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
COMPGEOM
2003
ACM
14 years 1 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
ANCS
2007
ACM
13 years 12 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
DBSEC
2010
101views Database» more  DBSEC 2010»
13 years 9 months ago
Generalizing PIR for Practical Private Retrieval of Public Data
Private retrieval of public data is useful when a client wants to query a public data service without revealing the specific query data to the server. Computational Private Informa...
Shiyuan Wang, Divyakant Agrawal, Amr El Abbadi
JOC
2007
94views more  JOC 2007»
13 years 7 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou...