Sciweavers

680 search results - page 47 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
ACSC
2007
IEEE
14 years 2 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka
BMCBI
2010
110views more  BMCBI 2010»
13 years 8 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec
JSAC
2010
131views more  JSAC 2010»
13 years 6 months ago
Joint synchronization and localization using TOAs: A linearization based WLS solution
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...
Shouhong Zhu, Zhiguo Ding
ICPR
2004
IEEE
14 years 9 months ago
Perceptual Grouping for Contour Extraction
This paper describes an algorithm that efficiently groups line segments into perceptually salient contours in complex images. A measure of affinity between pairs of lines is used ...
Francisco J. Estrada, Allan D. Jepson
ICASSP
2011
IEEE
12 years 11 months ago
Cooperative mobile network localization via subspace tracking
Two novel cooperative localization algorithms for mobile wireless networks are proposed. To continuously localize the mobile network, given the pairwise distance measurements betw...
Hadi Jamali Rad, Alon Amar, Geert Leus