724 search results - page 144 / 145 » Some Structural Complexity Aspects of Neural Computation |
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
WACV
2005
IEEE
14 years 1 months ago
2005
IEEE
The performance of face recognition systems that use two-dimensional images depends on consistent conditions w.r.t. lighting, pose, and facial appearance. We are developing a face...
ICALP
2003
Springer
14 years 26 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
APVIS
2007
13 years 9 months ago
2007
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
BMCBI
2007
13 years 7 months ago
2007
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...