5606 search results - page 447 / 1122 » Randomization Techniques for Graphs. |
135
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Existing data mining algorithms on graphs look for nodes satisfying specific properties, such as specific notions of structural similarity or specific measures of link-based impor...
168
Voted
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
184
click to vote
DAWAK
2005
Springer
16 years 9 days ago
2005
Springer
Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. Previous ...
174
click to vote
GBRPR
2005
Springer
16 years 6 days ago
2005
Springer
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
213
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...