Sciweavers

3154 search results - page 62 / 631
» Computing Closed Skycubes
Sort
View
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
14 years 1 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel
LICS
2000
IEEE
14 years 1 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
CDES
2006
99views Hardware» more  CDES 2006»
13 years 10 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
NIPS
2003
13 years 10 months ago
Computing Gaussian Mixture Models with EM Using Equivalence Constraints
Density estimation with Gaussian Mixture Models is a popular generative technique used also for clustering. We develop a framework to incorporate side information in the form of e...
Noam Shental, Aharon Bar-Hillel, Tomer Hertz, Daph...
CONCURRENCY
2010
75views more  CONCURRENCY 2010»
13 years 9 months ago
An Open Source performance tools software suite for scientific computing
With the rapid replacement of closed, homogeneous, proprietary HPC systems by heterogeneous, Linux-MPI cluster systems, the state of performance monitoring and analysis tools has ...
Philip J. Mucci, Tushar Mohan