Sciweavers

4095 search results - page 101 / 819
» How to test a tree
Sort
View
ALGORITHMICA
2011
13 years 5 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ACCV
2010
Springer
13 years 5 months ago
Face Recognition with Decision Tree-Based Local Binary Patterns
Many state-of-the-art face recognition algorithms use image descriptors based on features known as Local Binary Patterns (LBPs). While many variations of LBP exist, so far none of ...
Daniel Maturana, Domingo Mery, Alvaro Soto
EMNLP
2011
12 years 10 months ago
Heuristic Search for Non-Bottom-Up Tree Structure Prediction
State of the art Tree Structures Prediction techniques rely on bottom-up decoding. These approaches allow the use of context-free features and bottom-up features. We discuss the l...
Andrea Gesmundo, James Henderson
TOOLS
2009
IEEE
14 years 5 months ago
Reusing and Composing Tests with Traits
Single inheritance often forces developers to duplicate code and logic. This widely recognized situation affects both business code and tests. In a large and complex application w...
Stéphane Ducasse, Damien Pollet, Alexandre ...
ISPDC
2006
IEEE
14 years 4 months ago
Continuous Software Test Distributed Execution and Integrated into the Globus Toolkit
This article shows how the idea of continuous software testing [23] of a world wide working group can be well integrated into the Grid Computing paradigm using the Globus Toolkit ...
Christoph Reich, Bettina Scharpf