Sciweavers

428 search results - page 50 / 86
» Adding Dynamic Types to C
Sort
View
MFCS
2005
Springer
14 years 2 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
PEWASUN
2004
ACM
14 years 2 months ago
A performance evaluation framework for IEEE 802.11 ad-hoc networks
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
Ping Chung Ng, Soung Chang Liew, Li Bin Jiang
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 11 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
C3S2E
2009
ACM
14 years 3 months ago
CPU, SMP and GPU implementations of Nohalo level 1, a fast co-convex antialiasing image resampler
This article introduces Nohalo level 1 (“Nohalo”), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear...
Nicolas Robidoux, Minglun Gong, John Cupitt, Adam ...
MOBIQUITOUS
2008
IEEE
14 years 3 months ago
Context-aware fault tolerance in migratory services
Mobile ad hoc networks can be leveraged to provide ubiquitous services capable of acquiring, processing, and sharing real-time information from the physical world. Unlike Internet...
Oriana Riva, Josiane Nzouonta, Cristian Borcea