Sciweavers

STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 3 months ago
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
14 years 3 months ago
Limitations of quantum coset states for graph isomorphism
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
Sean Hallgren, Cristopher Moore, Martin Rötte...
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
14 years 3 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
14 years 3 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
SIGIR
2006
ACM
14 years 3 months ago
Finding near-duplicate web pages: a large-scale evaluation of algorithms
Broder et al.’s [3] shingling algorithm and Charikar’s [4] random projection based approach are considered “state-of-theart” algorithms for finding near-duplicate web pag...
Monika Rauch Henzinger
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
SI3D
2006
ACM
14 years 3 months ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
SCESM
2006
ACM
262views Algorithms» more  SCESM 2006»
14 years 3 months ago
Scenario-driven modeling and validation of requirements models
Requirements models for large systems typically cannot be developed in a single step, but evolve in a sequence of iterations. We have developed such an iterative modeling process ...
Christian Seybold, Silvio Meier, Martin Glinz
SCESM
2006
ACM
239views Algorithms» more  SCESM 2006»
14 years 3 months ago
Aspect-oriented software design with a variant of UML/STD
The notion of aspect is important as a systematic approach to the representation of cross-cutting concerns and the incremental additions of new functionalities to an existing syst...
Shin Nakajima, Tetsuo Tamai
SCESM
2006
ACM
257views Algorithms» more  SCESM 2006»
14 years 3 months ago
Test ready UML statechart models
The dynamic behavior of systems is best described by Finite-state machines. Generation of executable tests from behavioral models such as UML Statecharts offers benefits such as s...
P. V. R. Murthy, P. C. Anitha, M. Mahesh, Rajesh S...