Sciweavers

1679 search results - page 21 / 336
» Pointcuts as Functional Queries
Sort
View
106
Voted
ICDCSW
2007
IEEE
15 years 7 months ago
Using stream queries to measure communication performance of a parallel computing environment
We have developed a data stream management system that supports declarative stream queries running over high data volumes in a supercomputing environment. To enable specification ...
Erik Zeitler, Tore Risch
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 23 days ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
DATESO
2007
107views Database» more  DATESO 2007»
15 years 2 months ago
Updating Typed XML Documents Using a Functional Data Model
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
Pavel Loupal
106
Voted
FOCS
2003
IEEE
15 years 6 months 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
103
Voted
ICML
2005
IEEE
16 years 1 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore