Sciweavers

3359 search results - page 373 / 672
» A Simplified Idea Algorithm
Sort
View
120
Voted
COLT
2000
Springer
15 years 7 months ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
15 years 7 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio
EICS
2010
ACM
15 years 7 months ago
User interface model discovery: towards a generic approach
UI model discovery is a lightweight formal method in which a model of an interactive system is automatically discovered by exploring the system’s state space, simulating the act...
Andy Gimblett, Harold W. Thimbleby
ESSLLI
1999
Springer
15 years 7 months ago
Weak Equivalence in Propositional Calculus
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
Stefan Andrei
RTCSA
1999
IEEE
15 years 7 months ago
A Matlab Toolbox for Real-Time and Control Systems Co-Design
The paper presents a Matlab toolbox for simulation of real-time control systems. The basic idea is to simulate a real-time kernel in parallel with continuous plant dynamics. The t...
Johan Eker, Anton Cervin