1480 search results - page 237 / 296 » Distributed algorithms for weighted problems in sparse graph... |
136
click to vote
SIGKDD
2008
15 years 3 months ago
2008
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
127
click to vote
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
111
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
101
click to vote
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
153
click to vote
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...