IPL 2008 - PDF Preprint Papers

IPL 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPL-2008 Paper

click to vote

IPL
2008

172views more IPL 2008»

Approximation algorithms for restricted Bayesian network structures

13 years 4 months ago

Download www2.informatik.hu-berlin.de

Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...

Valentin Ziegler

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	172	Approximation algorithms for restricted Bayesian network structures	claim
2	169	Oriented colorings of partial 2-trees	claim
3	147	Streaming tree automata	claim
4	146	A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs	claim
5	145	Complexity analysis of a decentralised graph colouring algorithm	claim
6	135	On the Positive-Negative Partial Set Cover problem	claim
7	132	Asymptotic fully polynomial approximation schemes for variants of open-end bin packing	claim
8	131	Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models	claim
9	129	Parameterized approximation of dominating set problems	claim
10	128	About acyclic edge colourings of planar graphs	claim
11	118	Slicing for modern program structures: a theory for eliminating irrelevant loops	claim
12	114	The online Prize-Collecting Traveling Salesman Problem	claim
13	114	Faster algorithms for guided tree edit distance	claim
14	114	Cyclic reference counting	claim
15	111	Adding cardinality constraints to integer programs with applications to maximum satisfiability	claim
16	111	Flying over a polyhedral terrain	claim
17	110	Reduction of stochastic parity to stochastic mean-payoff games	claim
18	109	Description and analysis of a bottom-up DFA minimization algorithm	claim
19	107	Reachability on prefix-recognizable graphs	claim
20	105	Hausdorff approximation of 3D convex polytopes	claim
21	105	Finding cycles in hierarchical hypercube networks	claim
22	104	A note on harmonic subgraphs in labelled geometric graphs	claim
23	103	New efficiency results for makespan cost sharing	claim
24	102	The connection between two ways of reasoning about partial functions	claim
25	100	On the false-positive rate of Bloom filters	claim
26	99	A CKY parser for picture grammars	claim
27	98	Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time	claim
28	98	On the number of Go positions on lattice graphs	claim
29	97	Dynamic polar diagram	claim
30	95	Optimal point removal in closed-2PM labeling	claim
31	95	Efficient algorithms for finding interleaving relationship between sequences	claim
32	95	Approximating maximum satisfiable subsystems of linear equations of bounded width	claim
33	95	Distortion lower bounds for line embeddings	claim
34	95	The Generalized Maximum Coverage Problem	claim
35	95	Weighted automata with discounting	claim
36	93	Computing Longest Previous Factor in linear time and applications	claim
37	91	Well-balanced orientations of mixed graphs	claim
38	90	On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings	claim
39	89	On the tractability of coloring semirandom graphs	claim
40	87	Optimal prefix and suffix queries on texts	claim
41	86	A more efficient algorithm for perfect sorting by reversals	claim
42	85	An impossibility about failure detectors in the iterated immediate snapshot model	claim
43	84	Minimal proper interval completions	claim
44	84	The equational theory of prebisimilarity over basic CCS with divergence	claim
45	82	On fully orientability of 2-degenerate graphs	claim
46	82	Confusion of memory	claim
47	82	A note on the distribution of the number of prime factors of the integers	claim
48	80	Path partitions of hypercubes	claim
49	80	A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts	claim
50	79	The probability of "undefined" (non-converging) output in generating the universal probability distribution	claim
51	79	On the efficient construction of quasi-reversible automata for reversible languages	claim
52	79	Ski rental with two general options	claim
53	78	Resource-bounded measure on probabilistic classes	claim
54	78	An approximation ratio for biclustering	claim
55	77	On the coordinator's rule for Fast Paxos	claim
56	76	Asymmetric k-center with minimum coverage	claim
57	72	On the parameterized complexity of d-dimensional point set pattern matching	claim
58	72	Reducing communication costs in robust peer-to-peer networks	claim
59	72	Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers	claim
60	72	Turing degrees of reals of positive effective packing dimension	claim
61	70	Minimum-perimeter enclosures	claim
62	70	On the expressibility of priority	claim
63	68	The hub number of a graph	claim
64	68	Pseudo-relevance feedback and statistical query expansion for web snippet generation	claim
65	67	A note on the query complexity of the Condorcet winner problem	claim
66	65	On the fixed-parameter tractability of parameterized model-checking problems	claim
67	61	On the complexity of partial order trace model checking	claim
68	61	Online chasing problems for regular polygons	claim
69	61	Stability bounds in networks with dynamic link capacities	claim
70	60	A note on the Markoff condition and central words	claim
71	59	Faster index for property matching	claim
72	59	Dynamic bottleneck optimization for k-edge and 2-vertex connectivity	claim
73	59	Rigidity of a simple extended lower triangular matrix	claim
74	58	Two fixed-parameter algorithms for Vertex Covering by Paths on Trees	claim
75	58	Streaming algorithm for graph spanners - single pass and constant processing time per edge	claim
76	53	A Note on "An improved upper bound on the queuenumber of the hypercube"	claim
77	53	Anonymous graph exploration without collision by mobile robots	claim
78	52	A note on the inapproximability of correlation clustering	claim
79	51	On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion	claim
80	48	A tree-covering problem arising in integrity of tree-structured data	claim
81	41	On the interconnection of message passing systems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers