2520 search results - page 176 / 504 » The complexity of approximating entropy |
IJCAI
1997
15 years 11 days ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
114
Voted
UAI
1997
15 years 10 days ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
SODA
1992
ACM
15 years 5 days ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
115
click to vote
HAPTICS
2008
IEEE
15 years 2 days ago
2008
IEEE
The well known property of haptic interaction is the high refresh rate of the haptic loop that is necessary for the stability of the interaction. Therefore, only simple computation...
90
Voted
PVLDB
2008
14 years 10 months ago
2008
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...