Sciweavers

706 search results - page 13 / 142
» Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Sort
View
BMCBI
2006
126views more  BMCBI 2006»
13 years 7 months ago
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data
Background: As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heteroge...
Zizhen Yao, Walter L. Ruzzo
IWANN
1997
Springer
13 years 11 months ago
Dynamic Path Planning with Spiking Neural Networks
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...
PR
2007
134views more  PR 2007»
13 years 7 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
ICC
2009
IEEE
207views Communications» more  ICC 2009»
14 years 2 months ago
Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks
—Multipath routing can reduce the need for route updates, balance the traffic load and increase the data transfer rate in a wireless sensor network, improving the utilization of ...
Zijian Wang, Eyuphan Bulut, Boleslaw K. Szymanski
JCO
2006
150views more  JCO 2006»
13 years 7 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson