Sciweavers

332 search results - page 7 / 67
» Space Complexity vs. Query Complexity
Sort
View
KR
2004
Springer
15 years 11 months ago
Inferential Complexity Control for Model-Based Abduction
We describe a technique for speeding up inference for model-based abduction tasks that trades off inference time and/or space for the fraction of queries correctly answered. We co...
Gregory M. Provan
152
Voted
CGI
1998
IEEE
15 years 10 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 7 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
LREC
2008
86views Education» more  LREC 2008»
15 years 7 months ago
Tools for Collocation Extraction: Preferences for Active vs. Passive
We present and partially evaluate procedures for the extraction of noun+verb collocation candidates from German text corpora, along with their morphosyntactic preferences, especia...
Ulrich Heid, Marion Weller
ADC
2005
Springer
106views Database» more  ADC 2005»
15 years 11 months ago
OS Support for a Commodity Database on PC clusters - Distributed Devices vs. Distributed File Systems
In this paper we attempt to parallelise a commodity database for OLAP on a cluster of commodity PCs by using a distributed high-performance storage subsystem. By parallelising the...
Felix Rauch, Thomas Stricker