4009 search results - page 338 / 802 » Clustering on Complex Graphs |
208
click to vote
JALC
2002
15 years 6 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
170
Voted
DAC
2002
ACM
16 years 7 months ago
2002
ACM
Aim of this paper is to propose a methodology for the definition of an instruction-level energy estimation framework for VLIW (Very Long Instruction Word) processors. The power mo...
187
click to vote
HPCA
2003
IEEE
16 years 7 months ago
2003
IEEE
A challenging issue in today's server systems is to transparently deal with failures and application-imposed requirements for continuous operation. In this paper we address t...
180
click to vote
ADBIS
2006
Springer
16 years 23 days ago
2006
Springer
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
183
Voted
ICAPR
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...