Sciweavers

813 search results - page 68 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 4 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 2 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
14 years 9 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
SIGCSE
2002
ACM
149views Education» more  SIGCSE 2002»
13 years 8 months ago
A comprehensive project for CS2: combining key data structures and algorithms into an integrated web browser and search engine
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
Tia Newhall, Lisa Meeden
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
14 years 2 months ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan