3206 search results - page 361 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
104
Voted
SSDBM
2002
IEEE
15 years 7 months ago
2002
IEEE
We investigate the problem of searching similar multiattribute time sequences. Such sequences arise naturally in a number of medical, financial, video, weather forecast, and stoc...
135
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
116
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon an improved...
108
Voted
EMMCVPR
2009
Springer
15 years 9 months ago
2009
Springer
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
122
Voted
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...