785 search results - page 128 / 157 » Binary Join Trees |
165
click to vote
ICB
2007
Springer
15 years 11 months ago
2007
Springer
Effective and real-time face detection has been made possible by using the method of rectangle Haar-like features with AdaBoost learning since Viola and Jones’ work [12]. In this...
148
click to vote
TAMC
2007
Springer
15 years 11 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
140
click to vote
ICSE
2010
IEEE-ACM
15 years 9 months ago
2010
IEEE-ACM
Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However, most software is most...
146
click to vote
COLING
1992
15 years 6 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
143
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...