Sciweavers

7380 search results - page 1378 / 1476
» time 2008
Sort
View
172
Voted
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 6 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
INTEGRATION
2008
183views more  INTEGRATION 2008»
15 years 4 months ago
Network-on-Chip design and synthesis outlook
With the growing complexity in consumer embedded products, new tendencies forecast heterogeneous Multi-Processor SystemsOn-Chip (MPSoCs) consisting of complex integrated component...
David Atienza, Federico Angiolini, Srinivasan Mura...
SIGCSE
2009
ACM
213views Education» more  SIGCSE 2009»
16 years 4 months ago
Engaging middle school teachers and students with alice in a diverse set of subjects
This paper describes the integration of the Alice 3D virtual worlds environment into a diverse set of subjects in middle school, including the development of tutorials, example wo...
Susan H. Rodger, Jenna Hayes, Gaetjens Lezin, Henr...
PODC
2009
ACM
16 years 4 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
PODC
2011
ACM
14 years 7 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
« Prev « First page 1378 / 1476 Last » Next »