Sciweavers

2693 search results - page 89 / 539
» On Computing Complex Navigation Functions
Sort
View
AISC
2008
Springer
14 years 1 days ago
Automating Side Conditions in Formalized Partial Functions
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
Cezary Kaliszyk
NAR
2011
267views Computer Vision» more  NAR 2011»
13 years 4 months ago
EcoCyc: a comprehensive database of Escherichia coli biology
EcoCyc (http://EcoCyc.org) is a comprehensive model organism database for Escherichia coli K-12 MG1655. From the scientific literature, EcoCyc captures the functions of individual...
Ingrid M. Keseler, Julio Collado-Vides, Alberto Sa...
DMIN
2007
203views Data Mining» more  DMIN 2007»
13 years 11 months ago
Evaluation of Feature Selection Techniques for Analysis of Functional MRI and EEG
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
Lauren Burrell, Otis Smart, George J. Georgoulas, ...
WSCG
2003
142views more  WSCG 2003»
13 years 11 months ago
Dynamic Radiosity using Higher Order Functions Bases and Temporal Coherence
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
Venceslas Biri, Sylvain Michelin, Didier Arqu&egra...
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...