Sciweavers

2766 search results - page 190 / 554
» Algorithms for trigonometric polynomials
Sort
View
HYBRID
2010
Springer
15 years 11 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
ICML
2004
IEEE
16 years 5 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
RECOMB
2004
Springer
16 years 4 months ago
Reconstructing reticulate evolution in species: theory and practice
We present new methods for reconstructing reticulate evolution of species due to events such as horizontal transfer or hybrid speciation; both methods are based upon extensions of...
Luay Nakhleh, Tandy Warnow, C. Randal Linder
IEEECGIV
2008
IEEE
15 years 11 months ago
An Approach to the Feature-Based Comparisons for the Rational Curves
In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the s...
Chanon Aphirukmatakun, Natasha Dejdumrong
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang