Sciweavers

1382 search results - page 15 / 277
» Formal Analysis of Online Algorithms
Sort
View
MDAI
2007
Springer
15 years 11 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
NIPS
2004
15 years 7 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
CHI
2006
ACM
16 years 6 months ago
Using hybrid networks for the analysis of online software development communities
Social network-based systems usually suffer from two major limitations: they tend to rely on a single data source (e.g. email traffic), and the form of network patterns is often p...
Yevgeniy Eugene Medynskiy, Nicolas Ducheneaut, Aym...
ICDAR
2005
IEEE
15 years 11 months ago
A Two-stage Online Handwritten Chinese Character Segmentation Algorithm Based on Dynamic Programming
In this paper, an online handwritten Chinese character segmentation method is proposed. It is based on a dynamic programming algorithm, which uses geometrical features extracted f...
Xue Gao, Pierre Michel Lallican, Christian Viard-G...
FMCAD
2000
Springer
15 years 9 months ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi