Sciweavers

1707 search results - page 69 / 342
» A Computational Model for Arguments Understanding
Sort
View
NIPS
2004
14 years 11 months ago
Probabilistic Computation in Spiking Populations
As animals interact with their environments, they must constantly update estimates about their states. Bayesian models combine prior probabilities, a dynamical model and sensory e...
Richard S. Zemel, Quentin J. M. Huys, Rama Nataraj...
MFCS
1992
Springer
15 years 1 months ago
The Complexity of Graph Connectivity
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
Avi Wigderson
SMA
2005
ACM
125views Solid Modeling» more  SMA 2005»
15 years 3 months ago
One-dimensional selections for feature-based data exchange
In the parametric feature based design paradigm, most features possess arguments that are subsets of the boundary of the current model, subsets defined interactively by user sele...
Ari Rappoport, Steven N. Spitz, Michal Etzion
ICCS
2003
Springer
15 years 3 months ago
A Compiler Approach to Performance Prediction Using Empirical-Based Modeling
Abstract. Performance understanding and prediction are extremely important goals for guiding the application of program optimizations or in helping programmers focus their efforts...
Pedro C. Diniz
COMPLEXITY
2006
144views more  COMPLEXITY 2006»
14 years 10 months ago
BML revisited: Statistical physics, computer simulation, and probability
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
Raissa M. D'Souza