Sciweavers

40 search results - page 4 / 8
» Distance regularity of compositions of graphs
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 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
CANDC
2008
ACM
13 years 7 months ago
'Genome order index' should not be used for defining compositional constraints in nucleotide sequences
Background: The Z-curve is a three dimensional representation of DNA sequences proposed over a decade ago and has been extensively applied to sequence segmentation, horizontal gen...
Eran Elhaik, Dan Graur, Kresimir Josic
CVPR
2012
IEEE
11 years 10 months ago
Curvature-based regularization for surface approximation
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
Carl Olsson, Yuri Boykov
SIAMDM
2008
50views more  SIAMDM 2008»
13 years 7 months ago
Real Number Channel Assignments for Lattices
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
Jerrold R. Griggs, Xiaohua Teresa Jin
OPODIS
2008
13 years 9 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel