Sciweavers

1272 search results - page 106 / 255
» The Set Cover with Pairs Problem
Sort
View
FOCS
2004
IEEE
15 years 4 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
97
Voted
LATIN
2010
Springer
15 years 7 months ago
Colorful Strips
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
104
Voted
JNSM
2008
93views more  JNSM 2008»
15 years 23 days ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
97
Voted
APBC
2004
132views Bioinformatics» more  APBC 2004»
15 years 2 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 4 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ