Sciweavers

2593 search results - page 85 / 519
» On Two Problems of Nano-PLA Design
Sort
View
CONEXT
2008
ACM
14 years 11 months ago
EGOIST: overlay routing using selfish neighbor selection
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
Georgios Smaragdakis, Vassilis Lekakis, Nikolaos L...
BMCBI
2006
141views more  BMCBI 2006»
14 years 10 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
ECCV
2010
Springer
15 years 12 days ago
Learning PDEs for Image Restoration via Optimal Control
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...
EH
2005
IEEE
112views Hardware» more  EH 2005»
15 years 3 months ago
Development Brings Scalability to Hardware Evolution
The scalability problem is a major impediment to the use of hardware evolution for real-world circuit design problems. A potential solution is to model the map between genotype an...
Timothy G. W. Gordon, Peter J. Bentley
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 12 days ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...