Sciweavers

2503 search results - page 476 / 501
» New Algorithms for Statistical Analysis of Interval Data
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 5 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 6 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
ADBIS
2003
Springer
108views Database» more  ADBIS 2003»
15 years 5 months ago
Dynamic Integration of Classifiers in the Space of Principal Components
Recent research has shown the integration of multiple classifiers to be one of the most important directions in machine learning and data mining. It was shown that, for an ensemble...
Alexey Tsymbal, Mykola Pechenizkiy, Seppo Puuronen...
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 3 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...