Sciweavers

2100 search results - page 262 / 420
» Learning to rank on graphs
Sort
View
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 10 months ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
16 years 4 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft
CIKM
2009
Springer
16 years 1 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang
ICMCS
2005
IEEE
162views Multimedia» more  ICMCS 2005»
16 years 6 days ago
Clustering of Video Objects by Graph Matching
We propose a new graph-based data structure, called Spatio Temporal Region Graph (STRG) which can represent the content of video sequence. Unlike existing ones which consider main...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
JMM2
2007
127views more  JMM2 2007»
15 years 6 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos