Sciweavers

4526 search results - page 401 / 906
» Algorithmic problems related to the Internet
Sort
View
144
Voted
ACSD
2004
IEEE
86views Hardware» more  ACSD 2004»
15 years 10 months ago
Modular Analysis of Systems Composed of Semiautonomous Subsystems
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analys...
Charles Lakos, Laure Petrucci
168
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
CORR
2011
Springer
156views Education» more  CORR 2011»
15 years 1 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
RECOMB
2006
Springer
16 years 7 months ago
Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes
Micro-indels are small insertion or deletion events (indels) that occur during genome evolution. The study of micro-indels is important, both in order to better understand the unde...
Sagi Snir, Lior Pachter
ER
2004
Springer
90views Database» more  ER 2004»
16 years 6 days ago
Semantic Interpretation and Matching of Web Services
A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM ...
Chang Xu, Shing-Chi Cheung, Xiangye Xiao