Sciweavers

1022 search results - page 107 / 205
» New models and algorithms for programmable networks
Sort
View
120
Voted
TSP
2011
197views more  TSP 2011»
14 years 7 months ago
Group Object Structure and State Estimation With Evolving Networks and Monte Carlo Methods
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...
Amadou Gning, Lyudmila Mihaylova, Simon Maskell, S...
IPPS
1999
IEEE
15 years 5 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
102
Voted
KDD
1999
ACM
152views Data Mining» more  KDD 1999»
15 years 5 months ago
Applying General Bayesian Techniques to Improve TAN Induction
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
Jesús Cerquides
NDSS
2007
IEEE
15 years 7 months ago
RICH: Automatically Protecting Against Integer-Based Vulnerabilities
We present the design and implementation of RICH (Run-time Integer CHecking), a tool for efficiently detecting integer-based attacks against C programs at run time. C integer bug...
David Brumley, Dawn Xiaodong Song, Tzi-cker Chiueh...
99
Voted
ATAL
2010
Springer
15 years 1 months ago
How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model
It is to date an open question to know how the updating methods affect the evolution of a multi-agent system. This question has been tackled for various complex systems such as ce...
Nazim Fatès, Vincent Chevrier