Sciweavers

2584 search results - page 500 / 517
» On the Forward Checking Algorithm
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
POPL
2007
ACM
14 years 8 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 8 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 8 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
EDBT
2006
ACM
177views Database» more  EDBT 2006»
14 years 8 months ago
Authorization-Transparent Access Control for XML Under the Non-Truman Model
In authorization-transparent access control, users formulate their queries against the database schema rather than against authorization views that transform and hide data. The Tru...
Alberto O. Mendelzon, Renée J. Miller, Yaro...