Sciweavers

5889 search results - page 1163 / 1178
» Graph Layout Problems
Sort
View
111
Voted
STACS
1992
Springer
15 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
CIKM
2007
Springer
15 years 1 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
MIR
2010
ACM
191views Multimedia» more  MIR 2010»
15 years 1 months ago
Video retargeting with multi-scale trajectory optimization
Mobile devices are increasingly powerful in media storage and rendering. The prevalent request of decent video browsing on mobile devices is demanding. However, one limitation com...
Yuanning Li, YongHong Tian, Jingjing Yang, Ling-Yu...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
ATAL
2006
Springer
15 years 1 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
« Prev « First page 1163 / 1178 Last » Next »