10608 search results - page 616 / 2122 » Complexity of O'Hara's Algorithm |
190
click to vote
FOCS
2002
IEEE
16 years 5 days ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
214
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
177
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
214
click to vote
ECRTS
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
196
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...