Sciweavers

5606 search results - page 674 / 1122
» Randomization Techniques for Graphs.
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 10 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
ESANN
2006
15 years 8 months ago
Using Regression Error Characteristic Curves for Model Selection in Ensembles of Neural Networks
Regression Error Characteristic (REC) analysis is a technique for evaluation and comparison of regression models that facilitates the visualization of the performance of many regre...
Aloísio Carlos de Pina, Gerson Zaverucha
MVA
1994
15 years 8 months ago
Robust Line Drawing Understanding Incorporating Efficient Closed Symbols Extraction
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
Shin'ichi Satoh, Hiroshi Mo, Masao Sakauchi
AUTOMATICA
2007
92views more  AUTOMATICA 2007»
15 years 7 months ago
Observability analysis for structured bilinear systems: A graph-theoretic approach
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
T. Boukhobza, Frédéric Hamelin
JAIR
2010
145views more  JAIR 2010»
15 years 5 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon