405 search results - page 28 / 81 » Using critical sets to solve the maximum independent set pro... |
110
click to vote
CCCG
2007
15 years 3 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
127
click to vote
PODC
2011
ACM
14 years 4 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
113
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
123
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
141
click to vote
JAIR
2002
15 years 1 months ago
2002
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...