Sciweavers

816 search results - page 17 / 164
» Simulation Distances
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
ICIP
1997
IEEE
15 years 11 months ago
Binary Shape Coding Using 1-D Distance Values from Baseline
Here we describe a baseline-based binary shape coding method in which arbitrarily shaped object is represented by the traced 1-D data from baseline and turning point (TP). The sha...
Shi Hwa Lee, Dae-Sung Cho, Yu-Shin Cho, Sehoon Son...
87
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
TCP Internal Buffers Optimization for Fast Long-Distance Links
— In recent years, issues regarding the behavior of TCP in high-speed and long-distance networks have been extensively addressed in the networking research community, both becaus...
Andrea Baiocchi, Saverio Mascolo, Francesco Vacirc...
INFOCOM
2005
IEEE
15 years 3 months ago
Distributed querying of Internet distance information
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
Rodrigo Fonseca, Puneet Sharma, Sujata Banerjee, S...
ADHOCNOW
2004
Springer
15 years 3 months ago
Improving Distance Based Geographic Location Techniques in Sensor Networks
Supporting nodes without Global Positioning System (GPS) capability, in wireless ad hoc and sensor networks, has numerous applications in guidance and surveying systems in use toda...
Michel Barbeau, Evangelos Kranakis, Danny Krizanc,...