Sciweavers

4839 search results - page 396 / 968
» A survey of computational complexity results in systems and ...
Sort
View
IJCNN
2007
IEEE
16 years 1 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...
EUROPAR
2005
Springer
16 years 11 days ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
ICCV
2005
IEEE
16 years 14 days ago
A Joint System for Person Tracking and Face Detection
Abstract. Visual detection and tracking of humans in complex scenes is a challenging problem with a wide range of applications, for example surveillance and human-computer interact...
ZhenQiu Zhang, Gerasimos Potamianos, Andrew W. Sen...
FSTTCS
2008
Springer
15 years 8 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
14 years 6 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett