Sciweavers

630 search results - page 104 / 126
» Symbolic Domain Decomposition
Sort
View
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
14 years 3 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
ICASSP
2009
IEEE
14 years 3 months ago
Subspace tracking of fast time-varying channels in precoded MIMO-OFDM systems
This paper presents a blind subspace-based tracking scheme for precoded MIMO-OFDM systems over rapidly time-varying wireless channels. Subspace-based tracking is normally consider...
Chao-Cheng Tu, Benoît Champagne
SBMF
2009
Springer
184views Formal Methods» more  SBMF 2009»
14 years 3 months ago
Concolic Testing of the Multi-sector Read Operation for Flash Memory File System
In today’s information society, flash memory has become a virtually indispensable component, particularly for mobile devices. In order for mobile devices to operate successfully...
Moonzoo Kim, Yunho Kim
SMA
2009
ACM
130views Solid Modeling» more  SMA 2009»
14 years 3 months ago
A symbolic-numerical envelope algorithm using quadratic MOS patches
In this paper, we describe an algorithm for generating an exact rational envelope of a two-parameter family of spheres given by a quadratic patch in R3,1 , which is considered as ...
Bohumír Bastl, Jirí Kosinka, Mirosla...
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
14 years 2 months ago
Boosting Relational Sequence Alignments
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
Andreas Karwath, Kristian Kersting, Niels Landwehr