796 search results - page 115 / 160 » The Anonymous Subgraph Problem |
104
click to vote
KDD
2007
ACM
16 years 9 days ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
122
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
119
click to vote
MICRO
2005
IEEE
15 years 5 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
108
click to vote
ADC
2005
Springer
15 years 5 months ago
2005
Springer
We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level p...