Sciweavers

1760 search results - page 207 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
SPAA
2012
ACM
11 years 10 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
ECCV
2008
Springer
14 years 10 months ago
SERBoost: Semi-supervised Boosting with Expectation Regularization
The application of semi-supervised learning algorithms to large scale vision problems suffers from the bad scaling behavior of most methods. Based on the Expectation Regularization...
Amir Saffari, Helmut Grabner, Horst Bischof
ASP
2001
Springer
14 years 15 days ago
Computing stable models in parallel
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...
DAWAK
2007
Springer
13 years 12 months ago
An Efficient Algorithm for Identifying the Most Contributory Substring
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
Ben Stephenson
JMLR
2008
123views more  JMLR 2008»
13 years 8 months ago
Optimization Techniques for Semi-Supervised Support Vector Machines
Due to its wide applicability, the problem of semi-supervised classification is attracting increasing attention in machine learning. Semi-Supervised Support Vector Machines (S3VMs...
Olivier Chapelle, Vikas Sindhwani, S. Sathiya Keer...