2463 search results - page 150 / 493 » Rankings of Directed Graphs |
TSD
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
EJC
2010
13 years 9 months ago
2010
We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z3 2
SODA
2012
ACM
12 years 2 days ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
ICIP
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...