2446 search results - page 393 / 490 » Choiceless Polynomial Time |
185
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
191
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
166
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
172
click to vote
ISSTA
2000
ACM
15 years 10 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
194
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...