Sciweavers

44651 search results - page 8927 / 8931
» Generalized
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
14 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
ECEASST
2006
103views more  ECEASST 2006»
14 years 9 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
BMCBI
2007
144views more  BMCBI 2007»
14 years 9 months ago
InPrePPI: an integrated evaluation method based on genomic context for predicting protein-protein interactions in prokaryotic ge
Background: Although many genomic features have been used in the prediction of proteinprotein interactions (PPIs), frequently only one is used in a computational method. After rea...
Jingchun Sun, Yan Sun, Guohui Ding, Qi Liu, Chuan ...
JCSS
2008
120views more  JCSS 2008»
14 years 9 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
IJON
2007
120views more  IJON 2007»
14 years 9 months ago
Comparison of dynamical states of random networks with human EEG
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
Ralph Meier, Arvind Kumar, Andreas Schulze-Bonhage...
« Prev « First page 8927 / 8931 Last » Next »