1629 search results - page 277 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
108
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
116
click to vote
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—A vast number of historical and badly degraded document images can be found in libraries, public, and national archives. Due to the complex nature of different artifacts, such p...
VISUALIZATION
2005
IEEE
15 years 3 months ago
2005
IEEE
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
103
click to vote
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
104
click to vote
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...