675 search results - page 43 / 135 » Biased Range Trees |
ICDT
2003
ACM
15 years 4 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
VLSID
1993
IEEE
15 years 3 months ago
1993
IEEE
Low latency, application, specific multipliers are required for m,any DSP algorithms. Tree multipliers are an obvious answer to this requirement. However, tree architectures have ...
EPEW
2008
Springer
15 years 23 days ago
2008
Springer
The accessible specification of performance queries is a key challenge in performance analysis. To this end, we seek to combine the intuitive aspects of natural language query spec...
JOLLI
2010
14 years 9 months ago
2010
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
PPSN
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...