2612 search results - page 349 / 523 » Switching Graphs and Their Complexity |
174
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
151
click to vote
COSIT
2003
Springer
15 years 9 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
148
click to vote
DIS
2009
Springer
15 years 8 months ago
2009
Springer
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
134
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
153
Voted
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...