Sciweavers

1096 search results - page 49 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
VISUALIZATION
2000
IEEE
15 years 2 months ago
New techniques for topologically correct surface reconstruction
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
Udo Adamy, Joachim Giesen, Matthias John
ICASSP
2007
IEEE
15 years 4 months ago
A New Robust Frequency Domain Echo Canceller with Closed-Loop Learning Rate Adaptation
One of the main dif culties in echo cancellation is the fact that the learning rate needs to vary according to conditions such as double-talk and echo path change. Several methods...
Jean-Marc Valin, Iain B. Collings
AAAI
2006
14 years 11 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
SAC
2010
ACM
15 years 4 months ago
External sorting for index construction of large semantic web databases
Today’s Semantic Web datasets become increasingly larger containing up to several hundred million triples. The performance of index construction is a crucial factor for the succ...
Sven Groppe, Jinghua Groppe
SAT
2010
Springer
170views Hardware» more  SAT 2010»
15 years 1 months ago
Assignment Stack Shrinking
Assignment stack shrinking is a technique that is intended to speed up the performance of modern complete SAT solvers. Shrinking was shown to be efficient in SAT’04 competition w...
Alexander Nadel, Vadim Ryvchin