Sciweavers

1772 search results - page 284 / 355
» Classifying Problems into Complexity Classes
Sort
View
IPPS
2007
IEEE
14 years 4 months ago
Security Threat Prediction in a Local Area Network Using Statistical Model
In today’s large and complex network scenario vulnerability scanners play a major role from security perspective by proactively identifying the known security problems or vulner...
Somak Bhattacharya, S. K. Ghosh
MFCS
2010
Springer
13 years 8 months ago
Qualitative Analysis of Partially-Observable Markov Decision Processes
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICALP
2011
Springer
13 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
DCC
2002
IEEE
14 years 9 months ago
Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang