Sciweavers

166 search results - page 9 / 34
» Identifying State Transitions and their Functions in Source ...
Sort
View
DCC
2009
IEEE
14 years 8 months ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
DSN
2003
IEEE
14 years 25 days ago
A Data-Driven Finite State Machine Model for Analyzing Security Vulnerabilities
This paper combines an analysis of data on security vulnerabilities (published in Bugtraq database) and a focused source-code examination to develop a finite state machine (FSM) m...
Shuo Chen, Zbigniew Kalbarczyk, Jun Xu, Ravishanka...
CICLING
2007
Springer
14 years 1 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner
TIT
2010
153views Education» more  TIT 2010»
13 years 2 months ago
On the information rates of the plenoptic function
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
Arthur L. da Cunha, Minh N. Do, Martin Vetterli
COMPSAC
1996
IEEE
13 years 11 months ago
Applying Conventional Testing Techniques for Class Testing
This paper discusses how conventional testing criteria such as branch coverage can be applied for the testing of member functions inside a class. To support such testing technique...
In Sang Chung, Malcolm Munro, Wan Kwon Lee, Yong R...