Sciweavers

1160 search results - page 194 / 232
» Dynamic Programming Algorithm for Training Functional Networ...
Sort
View
NETWORKS
2010
15 years 14 days ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
CVPR
2007
IEEE
15 years 8 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
15 years 8 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
GI
2004
Springer
15 years 7 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
BMCBI
2010
150views more  BMCBI 2010»
15 years 2 months ago
AMS 3.0: prediction of post-translational modifications
Background: We present here the recent update of AMS algorithm for identification of post-translational modification (PTM) sites in proteins based only on sequence information, us...
Subhadip Basu, Dariusz Plewczynski