Sciweavers

683 search results - page 107 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
CVPR
2004
IEEE
16 years 5 months ago
From Fragments to Salient Closed Boundaries: An In-Depth Study
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image....
Song Wang, Jun Wang, Toshiro Kubota
105
Voted
EMSOFT
2003
Springer
15 years 8 months ago
Rate Monotonic vs. EDF: Judgment Day
Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedu...
Giorgio C. Buttazzo
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
16 years 4 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
124
Voted
BMCBI
2004
122views more  BMCBI 2004»
15 years 3 months ago
A comprehensive comparison of comparative RNA structure prediction approaches
Background: An increasing number of researchers have released novel RNA structure analysis and prediction algorithms for comparative approaches to structure prediction. Yet, indep...
Paul P. Gardner, Robert Giegerich
144
Voted
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 3 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...