Sciweavers

1716 search results - page 187 / 344
» Proving Conditional Termination
Sort
View
CPP
2011
107views more  CPP 2011»
14 years 18 days ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
143
Voted
TOG
2012
271views Communications» more  TOG 2012»
13 years 3 months ago
Mass splitting for jitter-free parallel rigid body simulation
We present a parallel iterative rigid body solver that avoids common artifacts at low iteration counts. In large or real-time simulations, iteration is often terminated before con...
Richard Tonge, Feodor Benevolenski, Andrey Voroshi...
101
Voted
CCS
2009
ACM
16 years 1 months ago
Confidentiality-preserving distributed proofs of conjunctive queries
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
Adam J. Lee, Kazuhiro Minami, Nikita Borisov
DCC
2005
IEEE
16 years 11 days ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
107
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
A Theory of QoS for Wireless
—Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control,...
I-Hong Hou, Vivek Borkar, P. R. Kumar