4541 search results - page 488 / 909 » Cache-Oblivious Algorithms and Data Structures |
166
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
167
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
186
click to vote
VALUETOOLS
2006
ACM
16 years 7 days ago
2006
ACM
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
166
click to vote
PAKDD
2009
ACM
16 years 1 months ago
2009
ACM
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
157
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...