2520 search results - page 322 / 504 » The complexity of approximating entropy |
173
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
166
click to vote
COLCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
193
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
171
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
169
click to vote
GRAPHICSINTERFACE
2008
15 years 8 months ago
2008
Rendering high-quality shadows in real-time is a challenging problem. Shadow mapping has proved to be an efficient solution, as it scales well for complex scenes. However, it suff...