Sciweavers

2042 search results - page 217 / 409
» Variable Number of
Sort
View
UAI
2003
15 years 7 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
189
Voted
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 7 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
AAAI
1996
15 years 7 months ago
Effects of Local Information on Group Behavior
Theperformanceof individual agents in a group dependscritically on the quality of information available to it about local and global goals and resources. In general it is assumed ...
Shounak Roychowdhury, Neeraj Arora, Sandip Sen
MVA
1990
145views Computer Vision» more  MVA 1990»
15 years 7 months ago
Finding Line Segments by Surface Fitting to the Hough Transform
We describe a method based on the Hough transform to compute a set of parameters that completely describe line segments. By complete, we mean the description includes the endpoint...
Wayne Niblack, Tai Truong
DICTA
2008
15 years 7 months ago
Automatic Categorization of Image Regions Using Dominant Color Based Vector Quantization
—This paper proposes a dominant color based vector quantization algorithm that automatically categorizes image regions. In contrast to the conventional vector quantization algori...
Md. Monirul Islam, Dengsheng Zhang, Guojun Lu