Sciweavers

3946 search results - page 514 / 790
» The computational complexity of choice sets
Sort
View
NAR
2007
100views more  NAR 2007»
15 years 6 months ago
PIC: Protein Interactions Calculator
Interactions within a protein structure and interactions between proteins in an assembly are essential considerations in understanding molecular basis of stability and functions o...
K. G. Tina, R. Bhadra, N. Srinivasan
JUCS
2010
141views more  JUCS 2010»
15 years 5 months ago
Trust-Oriented Composite Service Selection with QoS Constraints
Abstract: In Service-Oriented Computing (SOC) environments, service clients interact with service providers for consuming services. From the viewpoint of service clients, the trust...
Lei Li, Yan Wang, Ee-Peng Lim
CMPB
2010
171views more  CMPB 2010»
15 years 1 months ago
Metabolica: A statistical research tool for analyzing metabolic networks
Steady state flux balance analysis (FBA) for cellular metabolism is used, e.g., to seek information on the activity of the different pathways under equilibrium conditions, or as a...
Jenni Heino, Daniela Calvetti, Erkki Somersalo
TIP
2010
176views more  TIP 2010»
15 years 1 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
CORR
2012
Springer
176views Education» more  CORR 2012»
14 years 2 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...