Sciweavers

2621 search results - page 220 / 525
» Generalized Algorithms for Constructing Statistical Language...
Sort
View
88
Voted
WIA
2001
Springer
15 years 2 months ago
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
Jorge Graña, Francisco-Mario Barcala, Migue...
69
Voted
IWFM
1998
14 years 11 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
74
Voted
FDL
2005
IEEE
15 years 3 months ago
SystemC-Based Communication and Performance Analysis
In today’s electronic system-level (ESL) design processes, an early analysis of a system’s communication and nce characteristics is becoming a key challenge. The availability ...
Axel G. Braun, Joachim Gerlach, Wolfgang Rosenstie...
86
Voted
PLDI
2009
ACM
15 years 5 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
91
Voted
IPSN
2009
Springer
15 years 5 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...