Sciweavers

10568 search results - page 766 / 2114
» Computer Intelligence and Formalization
Sort
View
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
16 years 2 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
QEST
2008
IEEE
16 years 1 months ago
CaVi -- Simulation and Model Checking for Wireless Sensor Networks
CaVi provides a uniform interface to state-of-the-art simulation methods and formal verification methods for wireless sensor network. Simulation is suitable to examine the behavi...
Athanassios Boulis, Ansgar Fehnker, Matthias Fruth...
WACV
2007
IEEE
16 years 1 months ago
Motion Estimation Using a General Purpose Neural Network Simulator for Visual Attention
Motion detection and estimation is a first step in the much larger framework of attending to visual motion based on Selective Tuning Model of Visual Attention [1]. In order to be ...
Florentin Dorian Vintila, John K. Tsotsos
ICALP
2007
Springer
16 years 1 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
16 years 1 months ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin