1466 search results - page 148 / 294 » Complexity of Reasoning over Temporal Data Models |
129
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...
169
click to vote
SBIA
1995
Springer
15 years 8 months ago
1995
Springer
ion Framework for Compositional Modeling 36 Diane Chi and Yumi Iwasaki Model Decomposition and Simulation 45 Daniel J. Clancy and Benjamin Kuipers A Distance Measure for Attention ...
128
click to vote
CIVR
2003
Springer
15 years 9 months ago
2003
Springer
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
144
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
143
Voted
DATAMINE
2006
15 years 4 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...