Sciweavers

969 search results - page 87 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
14 years 2 months ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
VCIP
2003
147views Communications» more  VCIP 2003»
13 years 10 months ago
An objective method for combining multiple subjective data sets
International recommendations for subjective video quality assessment (e.g., ITU-R BT.500-11) include specifications for how to perform many different types of subjective tests. I...
Margaret H. Pinson, Stephen Wolf
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 9 months ago
An Information-Theoretical View of Network-Aware Malware Attacks
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulne...
Zesheng Chen, Chuanyi Ji
IJCAI
1989
13 years 10 months ago
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
Peter van Beek
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...