315 search results - page 62 / 63 » Cell-probe lower bounds for the partial match problem |
178
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
205
click to vote
CCS
2009
ACM
16 years 7 months ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
179
click to vote
INFOCOM
2007
IEEE
16 years 26 days ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
187
Voted
DSN
2006
IEEE
16 years 19 days ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
171
click to vote
ISPD
1998
ACM
15 years 10 months ago
1998
ACM
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...