Sciweavers

923 search results - page 161 / 185
» On the Computation of Relational View Complements
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 4 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 10 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
PDIS
1994
IEEE
15 years 10 months ago
Achieving Transaction Scaleup on Unix
Constructing scalable high-performance applications on commodity hardware running the Unix operating system is a problem that must be addressed in several application domains. We ...
Marie-Anne Neimat, Donovan A. Schneider
ISVC
2009
Springer
16 years 19 days ago
A Novel Method for Enhanced Needle Localization Using Ultrasound-Guidance
Abstract. In this paper, we propose a novel and fast method to localize and track needles during image-guided interventions. Our proposed method is comprised of framework of needle...
Bin Dong, Eric Savitsky, Stanley Osher
174
Voted
DIS
1999
Springer
15 years 10 months ago
The Melting Pot of Automated Discovery: Principles for a New Science
After two decades of research on automated discovery, many principles are shaping up as a foundation of discovery science. In this paper we view discovery science as automation of ...
Jan M. Zytkow