2434 search results - page 117 / 487 » Algorithmic Randomness of Closed Sets |
136
Voted
ANOR
2004
15 years 3 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
141
Voted
MMAS
2010
Springer
14 years 10 months ago
2010
Springer
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
133
Voted
EMNLP
2006
15 years 5 months ago
2006
Markov order-1 conditional random fields (CRFs) and semi-Markov CRFs are two popular models for sequence segmentation and labeling. Both models have advantages in terms of the typ...
124
Voted
IGPL
2006
15 years 3 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
129
Voted
DKE
2002
15 years 3 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...