1306 search results - page 169 / 262 » A Diagrammatic Approach to Model Completion |
182
click to vote
SC
2009
ACM
15 years 11 months ago
2009
ACM
In order to understand the complex physics of mother nature, physicist often use many approximations to understand one area of physics and then write a simulation to reduce these ...
179
click to vote
COREGRID
2007
Springer
16 years 18 days ago
2007
Springer
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have b...
202
click to vote
FIDJI
2003
Springer
15 years 11 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
149
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
207
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...