Sciweavers

9176 search results - page 1590 / 1836
» algorithms 2010
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 4 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
IMC
2010
ACM
15 years 4 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
INFOCOM
2010
IEEE
15 years 4 months ago
Cooperative Bridges: Topology Control in Cooperative Wireless Ad Hoc Networks
Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, pri...
Jieun Yu, Heejun Roh, Wonjun Lee, Sangheon Pack, D...
210
Voted
INFOCOM
2010
IEEE
15 years 4 months ago
Efficient Resource Allocation with Flexible Channel Cooperation in OFDMA Cognitive Radio Networks
Recently, a cooperative paradigm for single-channel cognitive radio networks has been advocated, where primary users can leverage secondary users to relay their traffic. However, i...
Hong Xu, Baochun Li
INFOCOM
2010
IEEE
15 years 4 months ago
Network Reliability With Geographically Correlated Failures
Abstract--Fiber-optic networks are vulnerable to natural disasters, such as tornadoes or earthquakes, as well as to physical failures, such as an anchor cutting underwater fiber ca...
Sebastian Neumayer, Eytan Modiano
« Prev « First page 1590 / 1836 Last » Next »