Sciweavers

19320 search results - page 153 / 3864
» On the complexity of computing determinants
Sort
View
CG
2004
Springer
15 years 8 months ago
An Improved Safety Solver for Computer Go
Most Go-playing programs use a combination of search and heuristics based on an influence function to determine whether territories are safe. However, to assure the correct evaluat...
Xiaozhen Niu, Martin Müller 0003
ICMLA
2007
15 years 6 months ago
Learning complex problem solving expertise from failures
Our research addresses the issue of developing knowledge-based agents that capture and use the problem solving knowledge of subject matter experts from diverse application domains...
Cristina Boicu, Gheorghe Tecuci, Mihai Boicu
119
Voted
WSC
1998
15 years 6 months ago
Input Modeling Tools for Complex Problems
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
Barry L. Nelson, Michael Yamnitsky
179
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Sparsity-undersampling tradeoff of compressed sensing in the complex domain
In this paper, recently developed ONE-L1 algorithms for compressed sensing are applied to complex-valued signals and sampling matrices. The optimal and iterative solution of ONE-L...
Zai Yang, Cishen Zhang
123
Voted
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
15 years 8 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek