Sciweavers

405 search results - page 28 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
CCCG
2007
13 years 9 months ago
Generalized Watchman Route Problem with Discrete View Cost
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...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
PODC
2011
ACM
12 years 10 months ago
Structuring unreliable radio networks
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...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 8 months ago
A new multi-view regression approach with an application to customer wallet estimation
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...
Srujana Merugu, Saharon Rosset, Claudia Perlich
CVPR
2008
IEEE
14 years 9 months ago
A Parallel Decomposition Solver for SVM: Distributed dual ascend using Fenchel Duality
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 ...
Tamir Hazan, Amit Man, Amnon Shashua
JAIR
2002
163views more  JAIR 2002»
13 years 7 months ago
Efficient Reinforcement Learning Using Recursive Least-Squares Methods
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...
Xin Xu, Hangen He, Dewen Hu