Sciweavers

3894 search results - page 657 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CIMAGING
2009
130views Hardware» more  CIMAGING 2009»
15 years 1 months ago
Quantitative phase and amplitude imaging using Differential-Interference Contrast (DIC) microscopy
We present an extension of the development of an alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitude and phase...
Chrysanthe Preza, Joseph A. O'Sullivan
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
15 years 25 days ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
163
Voted
AAAI
2011
14 years 3 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
265
Voted
ICDE
1998
IEEE
270views Database» more  ICDE 1998»
16 years 4 months ago
Cyclic Association Rules
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
Banu Özden, Sridhar Ramaswamy, Abraham Silber...
152
Voted
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 9 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin