18306 search results - page 423 / 3662 » Algorithmics in Exponential Time |
195
click to vote
IJCAI
1997
15 years 8 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
216
Voted
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
186
Voted
TKDE
2008
15 years 7 months ago
2008
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
181
click to vote
TSP
2008
15 years 7 months ago
2008
Abstract--This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modeling of observations and estimated signals. T...
206
Voted
ALGORITHMICA
2002
15 years 7 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...