Sciweavers

5158 search results - page 776 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
CSDA
2008
121views more  CSDA 2008»
15 years 6 months ago
ANOVA extensions for mixed discrete and continuous data
This paper is concerned withANOVA-like tests in the context of mixed discrete and continuous data. The likelihood ratio approach is used to obtain a location test in the mixed dat...
A. R. de Leon, Y. Zhu
DM
2010
102views more  DM 2010»
15 years 6 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
175
Voted
DAM
2008
84views more  DAM 2008»
15 years 6 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti
DISOPT
2008
81views more  DISOPT 2008»
15 years 6 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
ENTCS
2008
120views more  ENTCS 2008»
15 years 6 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke