Sciweavers

12783 search results - page 601 / 2557
» Experimenting with computing
Sort
View
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
15 years 8 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
190
Voted
IJCAI
2003
15 years 8 months ago
Improving Coevolutionary Search for Optimal Multiagent Behaviors
Evolutionary computation is a useful technique for learning behaviors in multiagent systems. Among the several types of evolutionary computation, one natural and popular method is...
Liviu Panait, R. Paul Wiegand, Sean Luke
ISMB
1993
15 years 8 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
MVA
1996
223views Computer Vision» more  MVA 1996»
15 years 8 months ago
Classification of Rotated and Scaled Textured Images Using Spectral Moments
This paper describes a classification method for rotated and scaled textured images using invariant parameters based on spectral-moments. Although it is well known that rotation i...
Yasuo Yoshida, Yue Wu
BMEI
2009
IEEE
15 years 8 months ago
An Improved Probabilistic Model for Finding Differential Gene Expression
Abstract--Finding differentially expressed genes is a fundamental objective of a microarray experiment. Recently proposed method, PPLR, considers the probe-level measurement error ...
Li Zhang, Xuejun Liu