Sciweavers

1888 search results - page 27 / 378
» Information Distance
Sort
View
INFOSCALE
2009
ACM
14 years 3 months ago
Measuring IP Address Fragmentation from BGP Routing Dynamics
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
Xia Yin, Xin Wu, Zhiliang Wang
EDBT
2011
ACM
225views Database» more  EDBT 2011»
13 years 6 days ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
VLDB
1990
ACM
74views Database» more  VLDB 1990»
14 years 22 days ago
Query Processing for Distance Metrics
In applications such as vision and molecular biology, a common problem is to find the similar objects to a given target (according to some distance measure) in a large database. T...
Jason Tsong-Li Wang, Dennis Shasha
TROB
2010
58views more  TROB 2010»
13 years 7 months ago
Localization: Approximation and Performance Bounds to Minimize Travel Distance
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
Craig A. Tovey, Sven Koenig
INFOCOM
2008
IEEE
14 years 3 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy