Sciweavers

44 search results - page 9 / 9
» Predicting Partial Paths from Planning Problem Parameters
Sort
View
BMCBI
2010
118views more  BMCBI 2010»
13 years 5 months ago
Walk-weighted subsequence kernels for protein-protein interaction extraction
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...
Seonho Kim, Juntae Yoon, Jihoon Yang, Seog Park
BTW
2007
Springer
136views Database» more  BTW 2007»
13 years 11 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
13 years 9 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
ECCV
2002
Springer
14 years 6 months ago
Building Roadmaps of Local Minima of Visual Models
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
Cristian Sminchisescu, Bill Triggs