1672 search results - page 249 / 335 » Optimizing Monitoring Queries over Distributed Data |
165
click to vote
IRREGULAR
1995
Springer
15 years 9 months ago
1995
Springer
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
184
Voted
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
162
Voted
SIGCOMM
2009
ACM
16 years 19 days ago
2009
ACM
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
146
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
172
click to vote
DATAMINE
1998
15 years 5 months ago
1998
Many applications of knowledge discovery and data mining such as rule discovery for semantic query optimization, database integration and decision support, require the knowledge t...