Sciweavers

1145 search results - page 215 / 229
» Discrete Green's Functions
Sort
View
LSSC
2007
Springer
14 years 4 months ago
Bridging Methods for Coupling Atomistic and Continuum Models
Abstract. We review some recent developments in the coupling of atomistic and continuum models based on the blending of the two models in a bridge region connecting the other two r...
Santiago Badia, Pavel B. Bochev, Max Gunzburger, R...
SOFSEM
2007
Springer
14 years 4 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
HICSS
2006
IEEE
163views Biometrics» more  HICSS 2006»
14 years 4 months ago
Learning Ranking vs. Modeling Relevance
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...
Dmitri Roussinov, Weiguo Fan
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
14 years 4 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan