Sciweavers

522 search results - page 92 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
CP
2007
Springer
15 years 3 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
OSDI
2004
ACM
15 years 12 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
ACSC
2006
IEEE
15 years 5 months ago
A framework for visual data mining of structures
Visual data mining has been established to effectively analyze large, complex numerical data sets. Especially, the extraction and visualization of inherent structures such as hie...
Hans-Jörg Schulz, Thomas Nocke, Heidrun Schum...
APLAS
2010
ACM
14 years 10 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
CVPR
2005
IEEE
16 years 1 months ago
Decentralized Multiple Target Tracking Using Netted Collaborative Autonomous Trackers
This paper presents a decentralized approach to multiple target tracking. The novelty of this approach lies in the use of a set of autonomous while collaborative trackers to overc...
Ting Yu, Ying Wu