Sciweavers

4095 search results - page 160 / 819
» How to test a tree
Sort
View
ACL
1990
13 years 11 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker
INFOCOM
2010
IEEE
13 years 8 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
ISBI
2008
IEEE
14 years 11 months ago
On the uncertainty in sequential hypothesis testing
We consider the problem of sequential hypothesis testing when the exact pdfs are not known but instead a set of iid samples are used to describe the hypotheses. We modify the clas...
Antonio Artés-Rodríguez, Fernando P&...
XPU
2009
Springer
14 years 5 months ago
Communicating Domain Knowledge in Executable Acceptance Test Driven Development
We present results of a case study looking at how domain knowledge is communicated to developers using executable acceptance test driven development at a large software development...
Shelly Park, Frank Maurer
DATE
2006
IEEE
98views Hardware» more  DATE 2006»
14 years 4 months ago
Test generation for combinational quantum cellular automata (QCA) circuits
— In this paper, we present a test generation framework for testing of quantum cellular automata (QCA) circuits. QCA is a nanotechnology that has attracted significant recent at...
Pallav Gupta, Niraj K. Jha, Loganathan Lingappan