Sciweavers

373 search results - page 42 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
3DIM
2005
IEEE
14 years 1 months ago
Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
Xiaoyi Jiang, Da-Chuan Cheng
FUN
2007
Springer
120views Algorithms» more  FUN 2007»
13 years 12 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
ICML
2004
IEEE
14 years 8 months ago
Co-EM support vector learning
Multi-view algorithms, such as co-training and co-EM, utilize unlabeled data when the available attributes can be split into independent and compatible subsets. Co-EM outperforms ...
Ulf Brefeld, Tobias Scheffer
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 5 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
ATAL
2004
Springer
14 years 1 months ago
Fitting and Compilation of Multiagent Models through Piecewise Linear Functions
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
David V. Pynadath, Stacy Marsella