Sciweavers

2626 search results - page 185 / 526
» The complexity of stochastic sequences
Sort
View
CORR
2008
Springer
123views Education» more  CORR 2008»
15 years 6 months ago
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
Shmuel Friedland
ENTCS
2010
110views more  ENTCS 2010»
15 years 6 months ago
Modelling Interactive Experience, Function and Performance in Ubiquitous Systems
The cost of deploying a ubiquitous system to enhance a physical environment is likely to be considerable. The success of its deployment is highly dependent on its context: the phy...
Michael D. Harrison, Mieke Massink
IJIT
2004
15 years 8 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
ENTCS
2010
122views more  ENTCS 2010»
15 years 6 months ago
Composition of Services with Constraints
Abstract. Web services composition is the interleaving of action sequences executed by elementary components in accordance with a client specification. We consider Web services as ...
Philippe Balbiani, Fahima Cheikh Alili, Pierre-Cyr...
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
16 years 7 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...