337 search results - page 45 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
137
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
111
Voted
FOCS
1989
IEEE
15 years 6 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
125
click to vote
ICDM
2010
IEEE
15 years 9 days ago
2010
IEEE
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
119
click to vote
WG
1993
Springer
15 years 6 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
128
click to vote
ASUNAM
2010
IEEE
15 years 3 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...