2168 search results - page 350 / 434 » Randomized Algorithms and Complexity Theory |
124
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
122
click to vote
WSC
1997
15 years 4 months ago
1997
The World Wide Web (WWW) has experienced a dramatic increase in popularity since 1993. Many reports indicate that its growth will continue at an exponential rate. This growth has ...
149
click to vote
ECCC
2007
15 years 3 months ago
2007
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
127
click to vote
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
149
click to vote
JLP
2006
15 years 3 months ago
2006
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...