Sciweavers

197 search results - page 18 / 40
» Dynamics of Random Early Detection
Sort
View
SGP
2004
14 years 7 days ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
14 years 2 months ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
ECCV
2010
Springer
13 years 10 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
PLDI
2005
ACM
14 years 3 months ago
DART: directed automated random testing
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
Patrice Godefroid, Nils Klarlund, Koushik Sen
KDD
2012
ACM
164views Data Mining» more  KDD 2012»
12 years 8 days ago
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
Jeffrey Chan, Wei Liu, Christopher Leckie, James B...