5448 search results - page 1027 / 1090 » Breakpoints and Time in Distributed Computations |
100
Voted
EMSOFT
2009
Springer
15 years 5 months ago
2009
Springer
Embedded systems such as smart cards or sensors are now widespread, but are often closed systems, only accessed via dedicated terminals. A new trend consists in embedding Web serv...
86
Voted
VLDB
1997
ACM
15 years 4 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
149
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
129
click to vote
CF
2007
ACM
15 years 4 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
114
click to vote
CCS
2006
ACM
15 years 4 months ago
2006
ACM
In this paper, we introduce the concept of witness anonymity for peer-to-peer systems. Witness anonymity combines the seemingly conflicting requirements of anonymity (for honest p...