Sciweavers

131 search results - page 25 / 27
» A General Method for Reducing the Complexity of Relational I...
Sort
View
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 6 days ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
VIS
2007
IEEE
130views Visualization» more  VIS 2007»
14 years 7 months ago
Interactive Visual Analysis of Perfusion Data
Perfusion data are dynamic medical image data which characterize the regional blood flow in human tissue. These data bear a great potential in medical diagnosis, since diseases can...
Steffen Oeltze, Helmut Doleisch, Helwig Hauser, ...
ALT
2003
Springer
13 years 10 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
JACM
2006
99views more  JACM 2006»
13 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
CF
2006
ACM
13 years 10 months ago
Performance characteristics of an adaptive mesh refinement calculation on scalar and vector platforms
Adaptive mesh refinement (AMR) is a powerful technique that reduces the resources necessary to solve otherwise intractable problems in computational science. The AMR strategy solv...
Michael L. Welcome, Charles A. Rendleman, Leonid O...