DAM 2007 - PDF Preprint Papers

DAM 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DAM-2007 Paper

click to vote

DAM
2007

177views more DAM 2007»

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

13 years 6 months ago

Download www.cse.yorku.ca

Given A := {a1, . . . , am} ⊂ Rd whose aﬃne hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...

Michael J. Todd, E. Alper Yildirim

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	177	On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids	claim
2	153	Computing the minimum number of hybridization events for a consistent evolutionary history	claim
3	141	On the packing chromatic number of Cartesian products, hexagonal lattice, and trees	claim
4	131	Haplotyping with missing data via perfect path phylogenies	claim
5	129	Easy and hard instances of arc ranking in directed graphs	claim
6	120	Advances on sorting by reversals	claim
7	111	Vertex-minor reductions can simulate edge contractions	claim
8	108	3D-interval-filament graphs	claim
9	107	Eliminating graphs by means of parallel knock-out schemes	claim
10	106	On the generation of bicliques of a graph	claim
11	105	Recognizing and representing proper interval graphs in parallel using merging and sorting	claim
12	103	The stable fixtures problem - A many-to-many extension of stable roommates	claim
13	100	Partially ordered knapsack and applications to scheduling	claim
14	100	Memory management optimization problems for integrated circuit simulators	claim
15	97	On Sturmian graphs	claim
16	94	New formulations for the Kissing Number Problem	claim
17	94	The harmonious coloring problem is NP-complete for interval and permutation graphs	claim
18	91	Integer linear programming approaches for non-unique probe selection	claim
19	91	A note on the precedence-constrained class sequencing problem	claim
20	88	Digital planarity - A review	claim
21	88	Hybrid one-dimensional reversible cellular automata are regular	claim
22	85	Testing primitivity on partial words	claim
23	85	Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes	claim
24	84	Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets	claim
25	83	The proof theoretic strength of the Steinitz exchange theorem	claim
26	82	Every toroidal graph without adjacent triangles is (4, 1)*-choosable	claim
27	81	Graphs, partitions and Fibonacci numbers	claim
28	79	Recognizing splicing languages: Syntactic monoids and simultaneous pumping	claim
29	79	Necessary conditions for multistationarity in discrete dynamical systems	claim
30	78	Flow trees for vertex-capacitated networks	claim
31	77	Decompositions of graphs of functions and fast iterations of lookup tables	claim
32	76	Super-simple (v, 5, 4) designs	claim
33	76	Fire containment in grids of dimension three and higher	claim
34	75	An efficient condition for a graph to be Hamiltonian	claim
35	74	On the uniform edge-partition of a tree	claim
36	73	Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model	claim
37	72	Binary templates for comma-free DNA codes	claim
38	72	Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI	claim
39	70	Tree-edges deletion problems with bounded diameter obstruction sets	claim
40	70	Path-kipas Ramsey numbers	claim
41	67	The state of SAT	claim
42	67	NP-completeness of generalized multi-Skolem sequences	claim
43	63	Attacking a public key cryptosystem based on tree replacement	claim
44	63	On encodings of spanning trees	claim
45	62	Cancellation properties of products of graphs	claim
46	61	Waiting times for clumps of patterns and for structured motifs in random sequences	claim
47	60	Restricting SBH ambiguity via restriction enzymes	claim
48	60	Introduction to partially ordered patterns	claim
49	60	The inverse protein folding problem on 2D and 3D lattices	claim
50	58	The test suite generation problem: Optimal instances and their implications	claim
51	56	Classes of cycle bases	claim
52	56	Geodesic-pancyclic graphs	claim
53	52	On the degree of homogeneous bent functions	claim
54	52	Random backtracking in backtrack search algorithms for satisfiability	claim
55	48	The fractional weak discrepancy of a partially ordered set	claim
56	47	Tutte sets in graphs II: The complexity of finding maximum Tutte sets	claim
57	41	Distance-two labelings of digraphs	claim
58	40	Finding submasses in weighted strings with Fast Fourier Transform	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers