Sciweavers

1382 search results - page 21 / 277
» Formal Analysis of Online Algorithms
Sort
View
ICPR
2006
IEEE
16 years 6 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
WWW
2007
ACM
16 years 6 months ago
Expertise networks in online communities: structure and algorithms
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...
Jun Zhang, Mark S. Ackerman, Lada A. Adamic
IPPS
2007
IEEE
15 years 12 months ago
Formal Analysis for Debugging and Performance Optimization of MPI
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
Ganesh Gopalakrishnan, Robert M. Kirby
ICPP
2006
IEEE
15 years 11 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
COLT
2006
Springer
15 years 9 months ago
A Randomized Online Learning Algorithm for Better Variance Control
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
Jean-Yves Audibert