Sciweavers

409 search results - page 72 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
13 years 11 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
GD
2004
Springer
14 years 26 days ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
CONCUR
2000
Springer
13 years 11 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
BMCBI
2007
127views more  BMCBI 2007»
13 years 7 months ago
The EIPeptiDi tool: enhancing peptide discovery in ICAT-based LC MS/MS experiments
Background: Isotope-coded affinity tags (ICAT) is a method for quantitative proteomics based on differential isotopic labeling, sample digestion and mass spectrometry (MS). The me...
Mario Cannataro, Giovanni Cuda, Marco Gaspari, Ser...
COMPGEOM
2006
ACM
14 years 1 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir