Sciweavers

1056 search results - page 132 / 212
» Constraint-Based Graph Matching
Sort
View
ERCIMDL
2010
Springer
158views Education» more  ERCIMDL 2010»
13 years 10 months ago
Ranking Entities Using Web Search Query Logs
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 9 months ago
The Complexity of Games on Higher Order Pushdown Automata
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Thierry Cachat, Igor Walukiewicz
ICASSP
2011
IEEE
13 years 26 days ago
The grouped two-sided orthogonal Procrustes problem
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
Bryan R. Conroy, Peter J. Ramadge
CVPR
2007
IEEE
14 years 3 months ago
Accurate Dynamic Sketching of Faces from Video
A sketch captures the most informative part of an object, in a much more concise and potentially robust representation (e.g., for face recognition or new capabilities of manipulat...
Zijian Xu, Jiebo Luo
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 2 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar