5114 search results - page 693 / 1023 » Complex networks |
164
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
156
click to vote
INFOCOM
2005
IEEE
16 years 9 days ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
187
click to vote
ICN
2005
Springer
16 years 5 days ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
178
click to vote
DAGM
2003
Springer
15 years 12 months ago
2003
Springer
Compared to their ancestors in the early 1970s, present day computer games are of incredible complexity and show magnificent graphical performance. However, in programming intelli...
218
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...