Sciweavers

2520 search results - page 68 / 504
» The complexity of approximating entropy
Sort
View
SDM
2003
SIAM
110views Data Mining» more  SDM 2003»
14 years 11 months ago
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
Jaakko Hollmén, Jouni K. Seppänen, Hei...
TREC
2003
14 years 11 months ago
Edinburgh-Stanford TREC-2003 Genomics Track
We describe our participation in both tasks in the 2003 TREC Genomics track. For the primary task we concentrated mainly upon query expansion and species-specific document search...
Miles Osborne, Mark Cuminskey, Gail Sinclair, Matt...
TCOM
2011
155views more  TCOM 2011»
14 years 5 months ago
Asymptotically Optimal Model Estimation for Quantization
—Using high-rate theory approximations we introduce flexible practical quantizers based on possibly non-Gaussian models in both the constrained resolution (CR) and the constrain...
Alexey Ozerov, W. Bastiaan Kleijn
ORL
2006
118views more  ORL 2006»
14 years 10 months ago
On complexity of multistage stochastic programs
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
Alexander Shapiro
AI
2005
Springer
14 years 10 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val