Sciweavers

18090 search results - page 518 / 3618
» Computing by Only Observing
Sort
View
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
16 years 10 days ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
FOCS
2003
IEEE
16 years 7 days ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis
CW
2002
IEEE
15 years 12 months ago
Process of Software Evolution
A number of interesting phenomena can be observed when lifelong processes of object-oriented software are analyzed from the viewpoint of software evolution. This paper proposes a ...
Tetsuo Tamai
CONTENT
2001
Springer
15 years 11 months ago
Buffy, an SL Development Environment
A development environment for RenderMan shaders has been implemented, allowing the SL programmer to observe the bahaviour of variables in both time and space. By allowing both nov...
Ian Stephenson
STAIRS
2008
175views Education» more  STAIRS 2008»
15 years 8 months ago
Learning Process Behavior with EDY: an Experimental Analysis
This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from ...
Ugo Galassi