Sciweavers

4536 search results - page 115 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Semi-supervised discriminant analysis based on UDP regularization
We propose a semi-supervised learning algorithm for discriminant analysis, which uses the geometric structure of both labeled and unlabeled samples and perform a manifold regulari...
Huining Qiu, Jian-Huang Lai, Jian Huang, Yu Chen
CIDM
2007
IEEE
14 years 3 months ago
Structure Prediction in Temporal Networks using Frequent Subgraphs
— There are several types of processes which can be modeled explicitly by recording the interactions between a set of actors over time. In such applications, a common objective i...
Mayank Lahiri, Tanya Y. Berger-Wolf
ECML
2007
Springer
14 years 3 months ago
Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendr...
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
14 years 3 months ago
A Generalization of Forward-Backward Algorithm
Structured prediction has become very important in recent years. A simple but notable class of structured prediction is one for sequences, so-called sequential labeling. For sequen...
Ai Azuma, Yuji Matsumoto
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
13 years 7 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro