Sciweavers

11740 search results - page 263 / 2348
» More Problems in Rewriting
Sort
View
UAI
2008
15 years 8 months ago
The Computational Complexity of Sensitivity Analysis and Parameter Tuning
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
Johan Kwisthout, Linda C. van der Gaag
FOIS
2006
15 years 8 months ago
A Reusable Ontology for Fluents in OWL
A critical problem for practical KR is dealing with relationships that change over time. This problem is compounded by representation languages such as OWL that are biased towards ...
Christopher A. Welty, Richard Fikes
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 8 months ago
Real scaled matching
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
Amihood Amir, Ayelet Butman, Moshe Lewenstein
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 8 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
SODA
1990
ACM
82views Algorithms» more  SODA 1990»
15 years 7 months ago
Visibility with a Moving Point of View
We investigate 3-d visibility problems in which the viewing position moves along a straight flightpath. Specifically we focus on two problems: determining the points along the fli...
Marshall W. Bern, David P. Dobkin, David Eppstein,...