ISAAC 2005 - PDF Preprint Papers

ISAAC 2005 International Symposium on Algorithms and Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ISAAC-2005 Paper

click to vote

ISAAC
2005
Springer

153views Algorithms» more ISAAC 2005»

Network Game with Attacker and Protector Entities

14 years 5 months ago

Download www.cs.ucy.ac.cy

Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...

Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	153	Network Game with Attacker and Protector Entities	claim
2	145	A Novel Adaptive Learning Algorithm for Stock Market Prediction	claim
3	138	On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm	claim
4	135	Embedding Point Sets into Plane Graphs of Small Dilation	claim
5	131	Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends	claim
6	129	SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data	claim
7	127	Decision Making Based on Approximate and Smoothed Pareto Curves	claim
8	127	Counting Stable Strategies in Random Evolutionary Games	claim
9	127	On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems	claim
10	123	Sampling Unlabeled Biconnected Planar Graphs	claim
11	122	Fast k-Means Algorithms with Constant Approximation	claim
12	120	Average Case Analysis for Tree Labelling Schemes	claim
13	120	Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem	claim
14	118	External Data Structures for Shortest Path Queries on Planar Digraphs	claim
15	117	Basic Computations in Wireless Networks	claim
16	116	Multiple Polyline to Polygon Matching	claim
17	113	Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks	claim
18	113	A Simple Optimal Randomized Algorithm for Sorting on the PDM	claim
19	112	Hybrid Voting Protocols and Hardness of Manipulation	claim
20	111	Multi-directional Width-Bounded Geometric Separator and Protein Folding	claim
21	111	Boosting Spectral Partitioning by Sampling and Iteration	claim
22	111	Smoothed Analysis of Binary Search Trees	claim
23	110	Minimum Entropy Coloring	claim
24	110	Revisiting T. Uno and M. Yagiura's Algorithm	claim
25	109	Drawing Phylogenetic Trees	claim
26	109	On the Complexity of Global Constraint Satisfaction	claim
27	109	Recursion Theoretic Operators for Function Complexity Classes	claim
28	107	Minimizing a Monotone Concave Function with Laminar Covering Constraints	claim
29	106	Distance Labeling in Hyperbolic Graphs	claim
30	106	Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs	claim
31	105	A 1.75-Approximation Algorithm for Unsigned Translocation Distance	claim
32	104	Network Load Games	claim
33	102	Dense Subgraph Problems with Output-Density Conditions	claim
34	100	Separability with Outliers	claim
35	100	Minimum Weight Triangulation by Cutting Out Triangles	claim
36	100	Hardness and Approximation of Octilinear Steiner Trees	claim
37	98	Casting an Object with a Core	claim
38	98	Complexity of the Min-Max (Regret) Versions of Cut Problems	claim
39	97	A Min-Max Relation on Packing Feedback Vertex Sets	claim
40	93	Representation of Graphs by OBDDs	claim
41	91	Sparse Geometric Graphs with Small Dilation	claim
42	90	Approximate Colored Range Queries	claim
43	89	Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics	claim
44	88	Monitoring Continuous Band-Join Queries over Dynamic Data	claim
45	88	Combinatorial Network Abstraction by Trees and Distances	claim
46	86	On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons	claim
47	85	Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition	claim
48	81	Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem	claim
49	78	The Phase Matrix	claim
50	78	Upper Bounds on the Computational Power of an Optical Model of Computation	claim
51	76	Improved Algorithms for the k Maximum-Sums Problems	claim
52	72	Simultaneous Matchings	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers