Sciweavers

54 search results - page 9 / 11
» Formal Language Constrained Path Problems
Sort
View
DOCENG
2009
ACM
14 years 2 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
IWEC
2010
13 years 9 months ago
Analyzing Computer Game Narratives
In many computer games narrative is a core component with the game centering on an unfolding, interactive storyline which both motivates and is driven by the game-play. Analyzing n...
Clark Verbrugge, Peng Zhang
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 8 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
TASLP
2010
153views more  TASLP 2010»
13 years 5 months ago
On Optimal Frequency-Domain Multichannel Linear Filtering for Noise Reduction
Abstract—Several contributions have been made so far to develop optimal multichannel linear filtering approaches and show their ability to reduce the acoustic noise. However, th...
Mehrez Souden, Jacob Benesty, Sofiène Affes
POPL
1995
ACM
13 years 11 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands