4095 search results - page 163 / 819 » How to test a tree |
100
click to vote
FAC
2008
2008
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
15 years 14 days ago
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of th...
98
Voted
TIT
2002
15 years 1 days ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
101
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
86
Voted
CADE
2008
Springer
16 years 22 days ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
107
Voted
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....