Sciweavers

1941 search results - page 112 / 389
» On the Hardness of Approximate Reasoning
Sort
View
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 7 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
FLAIRS
2004
15 years 7 months ago
Physical Approximations for Urban Fire Spread Simulations
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
Daniel J. Bertinshaw, Hans W. Guesgen
MMAS
2010
Springer
15 years 1 months ago
Sharp Stability Estimates for the Force-Based Quasicontinuum Approximation of Homogeneous Tensile Deformation
The accuracy of atomistic-to-continuum hybrid methods can be guaranteed only for deformations where the lattice configuration is stable for both the atomistic energy and the hybrid...
Matthew Dobson, Mitchell Luskin, Christoph Ortner
RTAS
2007
IEEE
16 years 20 days ago
Real-Time Task Replication for Fault Tolerance in Identical Multiprocessor Systems
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Shau-Y...
WSC
2001
15 years 7 months ago
Deterministic fluid models of congestion control in high-speed networks
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
Sanjay Shakkottai, R. Srikant