Sciweavers

903 search results - page 99 / 181
» Non-well-founded trees in categories
Sort
View
MOBIHOC
2007
ACM
16 years 6 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
POPL
2010
ACM
16 years 3 months ago
Sequential Verification of Serializability
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...
G. Ramalingam, Hagit Attiya, Noam Rinetzky
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Human Motion Synthesis with Optimization-based Graphs
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
Cheng Ren, Liming Zhao, Alla Safonova
GLVLSI
2009
IEEE
123views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Power efficient tree-based crosslinks for skew reduction
Clock distribution networks are an important design issue that is highly dependent on delay variations and load imbalances, while requiring power efficiency. Existing mesh solutio...
Inna Vaisband, Ran Ginosar, Avinoam Kolodny, Eby G...
ATAL
2009
Springer
16 years 28 days ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham