Sciweavers

83 search results - page 14 / 17
» Graph Matching using Commute Time Spanning Trees
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 2 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
SIGMOD
2005
ACM
194views Database» more  SIGMOD 2005»
14 years 1 months ago
STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 7 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 5 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 1 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...