Sciweavers

1095 search results - page 156 / 219
» Preprocessing of Intractable Problems
Sort
View
INFOCOM
2010
IEEE
13 years 9 months ago
A Signal Processing View on Packet Sampling and Anomaly Detection
—Anomaly detection methods typically operate on pre-processed, i.e., sampled and aggregated, traffic traces. Most traffic capturing devices today employ random packet sampling,...
Daniela Brauckhoff, Kavé Salamatian, Martin...
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
14 years 11 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
COMPGEOM
2006
ACM
14 years 4 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
BIRTHDAY
2003
Springer
14 years 3 months ago
Extreme Model Checking
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
ICALP
2010
Springer
14 years 3 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket