Sciweavers

7430 search results - page 1249 / 1486
» Programming Applications in CIFF
Sort
View
146
Voted
PASTE
2010
ACM
15 years 7 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
ECLIPSE
2005
ACM
15 years 7 months ago
Bridging the gap between technical and social dependencies with Ariadne
One of the reasons why large-scale software development is difficult is the number of dependencies that software engineers need to face: e.g., dependencies among the software comp...
Erik Trainer, Stephen Quirk, Cleidson R. B. de Sou...
ESOP
2008
Springer
15 years 6 months ago
A Formal Implementation of Value Commitment
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
Cédric Fournet, Nataliya Guts, Francesco Za...
191
Voted
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
15 years 6 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 6 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
« Prev « First page 1249 / 1486 Last » Next »