Sciweavers

28888 search results - page 5401 / 5778
» Computability and complexity in analysis
Sort
View
BMCBI
2007
151views more  BMCBI 2007»
15 years 4 months ago
Identification of hot regions in protein-protein interactions by sequential pattern mining
Background: Identification of protein interacting sites is an important task in computational molecular biology. As more and more protein sequences are deposited without available...
Chen-Ming Hsu, Chien-Yu Chen, Baw-Jhiune Liu, Chih...
EXPERT
2006
84views more  EXPERT 2006»
15 years 4 months ago
Infrastructure for Engineered Emergence on Sensor/Actuator Networks
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
Jacob Beal, Jonathan Bachrach
GRID
2006
Springer
15 years 4 months ago
Using Workflow for Dynamic Security Context Management in Grid-based Applications
This paper presents ongoing research and current results on the development of flexible access control infrastructures for complex resource provisioning in Grid-based collaborativ...
Yuri Demchenko, Leon Gommans, Cees de Laat, Arie T...
GRID
2006
Springer
15 years 4 months ago
The Palantir Grid Meta-Information System
Grids allow large scale resource-sharing across different administrative domains. Those diverse resources are likely to join or quit the Grid at any moment or possibly to break dow...
Francesc Guim, Ivan Rodero, M. Tomas, Julita Corba...
DAM
2007
107views more  DAM 2007»
15 years 4 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
« Prev « First page 5401 / 5778 Last » Next »