Sciweavers

1184 search results - page 47 / 237
» Nearness relations and topology
Sort
View
JSYML
2011
108views more  JSYML 2011»
13 years 4 months ago
Analytic equivalence relations and bi-embeddability
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
Sy-David Friedman, Luca Motto Ros
ICRA
2009
IEEE
127views Robotics» more  ICRA 2009»
14 years 4 months ago
Relative bearing estimation from commodity radios
— Relative bearing between robots is important in applications like pursuit-evasion [11] and SLAM [7]. This is also true in in sensor networks, where the bearing of one sensor no...
Karthik Dantu, Prakhar Goyal, Gaurav S. Sukhatme
CIKM
2003
Springer
14 years 3 months ago
The link prediction problem for social networks
Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link predicti...
David Liben-Nowell, Jon M. Kleinberg
ENTCS
2008
91views more  ENTCS 2008»
13 years 10 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
TPDS
2010
109views more  TPDS 2010»
13 years 8 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa