12659 search results - page 23 / 2532 » The distributed breakout algorithms |
142
click to vote
PAMI
2011
14 years 10 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
156
Voted
ESA
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
245
Voted
TASE
2012
IEEE
13 years 11 months ago
2012
IEEE
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
170
Voted
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
—This paper investigates the problem of incremental detection of errors in distributed data. Given a distributed database D, a set Σ of conditional functional dependencies (CFDs...