Sciweavers

13987 search results - page 751 / 2798
» The Two Guards Problem
Sort
View
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
16 years 2 months ago
Projective Clustering Ensembles
Recent advances in data clustering concern clustering ensembles and projective clustering methods, each addressing different issues in clustering problems. In this paper, we consi...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
LICS
2009
IEEE
16 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
16 years 2 months ago
A Comparison of Performance Measures for Online Algorithms
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
Joan Boyar, Sandy Irani, Kim S. Larsen
CIKM
2009
Springer
16 years 2 months ago
Automatic link detection: a sequence labeling approach
The popularity of Wikipedia and other online knowledge bases has recently produced an interest in the machine learning community for the problem of automatic linking. Automatic hy...
James J. Gardner, Li Xiong
CSL
2009
Springer
16 years 2 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To