1629 search results - page 127 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
CVPR
2004
IEEE
16 years 2 days ago
2004
IEEE
Recognition difficulty is statistically linked to ??? subject covariate factors such as age and gender for three face recognition algorithms: principle components analysis, an int...
CG
2008
Springer
15 years 1 days ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...