Sciweavers

154 search results - page 18 / 31
» Anytime search in dynamic graphs
Sort
View
MM
2010
ACM
151views Multimedia» more  MM 2010»
15 years 6 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
AI
1999
Springer
15 years 5 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
UM
2005
Springer
15 years 11 months ago
ExpertiseNet: Relational and Evolutionary Expert Modeling
We develop a novel user-centric modeling technology, which can dynamically describe and update a person's expertise profile. In an enterprise environment, the technology can e...
Xiaodan Song, Belle L. Tseng, Ching-Yung Lin, Ming...

Lecture Notes
443views
17 years 3 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
ICCV
2007
IEEE
16 years 10 days ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers