Sciweavers

870 search results - page 114 / 174
» The statistical significance of the MUC-5 results
Sort
View
ECCV
2002
Springer
15 years 12 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
MICCAI
2003
Springer
15 years 11 months ago
Caudate Shape Discrimination in Schizophrenia Using Template-Free Non-parametric Tests
This paper describes shape analysis of the caudate nucleus structure in a large schizophrenia study (30 controls, 60 schizophrenics). Although analysis of the caudate has not drawn...
Y. Sampath K. Vetsa, Martin Styner, Stephen M. Piz...
SIGSOFT
2002
ACM
15 years 10 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
WWW
2008
ACM
15 years 10 months ago
Efficient multi-keyword search over p2p web
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
Hanhua Chen, Hai Jin, Jiliang Wang, Lei Chen 0002,...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
15 years 10 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...