Sciweavers

18209 search results - page 93 / 3642
» Some Remarks on the Paper
Sort
View
FOCS
1992
IEEE
14 years 2 months ago
On the Fault Tolerance of Some Popular Bounded-Degree Networks
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. ...
ECIS
2004
13 years 11 months ago
Mobilizing medical information and knowledge: some insights from a survey
The mobile medical information system investigated in the study is developed for mobilizing medical information and knowledge and for matching physicians' multiple needs, inc...
Shengnan Han, Ville Harkke, Pekka Mustonen, Matti ...
TON
2012
12 years 14 days ago
Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
Yi Shi, Y. Thomas Hou
FOCS
2008
IEEE
14 years 4 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
14 years 2 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...