Sciweavers

86 search results - page 14 / 18
» Definability in Substructure Orderings, II: Finite Ordered S...
Sort
View
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
13 years 5 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
HASE
2007
IEEE
14 years 1 months ago
On the Verifiability of Programs Written in the Feature Language Extensions
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
Wu-Hon F. Leung
CSCLP
2008
Springer
13 years 9 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
JCAM
2010
116views more  JCAM 2010»
13 years 2 months ago
A vertex-based hierarchical slope limiter for p-adaptive discontinuous Galerkin methods
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
Dmitri Kuzmin