Sciweavers

2778 search results - page 414 / 556
» Limit complexities revisited
Sort
View
MMAS
2010
Springer
15 years 1 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
NGC
2010
Springer
183views Communications» more  NGC 2010»
15 years 1 months ago
Brain-like Computing Based on Distributed Representations and Neurodynamics
A key to overcoming the limitations of classical artificial intelligence and to deal well with enormous amounts of information might be brain-like computing in which distributed re...
Ken Yamane, Masahiko Morita
PVLDB
2010
252views more  PVLDB 2010»
15 years 1 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
SIAMNUM
2010
178views more  SIAMNUM 2010»
15 years 1 months ago
A New Class of High Order Finite Volume Methods for Second Order Elliptic Equations
In the numerical simulation of many practical problems in physics and engineering, finite volume methods are an important and popular class of discretization methods due to the loc...
Long Chen
TCAD
2010
154views more  TCAD 2010»
15 years 1 months ago
Automated Design Debugging With Maximum Satisfiability
As contemporary VLSI designs grow in complexity, design debugging has rapidly established itself as one of the largest bottlenecks in the design cycle today. Automated debug soluti...
Yibin Chen, Sean Safarpour, João Marques-Si...