Sciweavers

555 search results - page 30 / 111
» Decompositions of Grammar Constraints
Sort
View
TALG
2010
110views more  TALG 2010»
13 years 8 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
HASE
2008
IEEE
14 years 4 months ago
A Grammar-Based Reverse Engineering Framework for Behavior Verification
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...
Chunying Zhao, Kang Zhang
AMC
2007
100views more  AMC 2007»
13 years 10 months ago
An alternative proof for the explicit equations of motion for mechanical systems with independent non-ideal constraints
An alternative proof for the explicit equations of motion for mechanical systems with independent non-ideal constraints is proposed in this paper. These equations are derived with...
Po Chih Chen, Chia-Ou Chang, W. T. Chang Chien
ICIP
1999
IEEE
14 years 11 months ago
Adaptive Wavelet-Packet Decomposition for Rate Control of Object Oriented Coding of Video Sequences
A novel object dependent coding scheme based on optimization upon wavelet packet trees is proposed. The method may be employed in the context of object oriented video standard MPE...
Ioannis Stephanakis, Anastasios D. Doulamis, Nikol...
COLING
1992
13 years 11 months ago
A Lexicalist Account of Icelandic Case Marking
Recent theoretical descriptions of the Icelandic case system distinguish between lexicai and structural case. Lexical case is assigned in ttle lexiCOIl, whereas structural case is...
Gosse Bouma