2698 search results - page 338 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
150
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Behavioral Signal Processing aims at automating behavioral coding schemes such as those prevalent in psychology and mental health research. This paper describes methods to quantif...
189
click to vote
ISAAC
2007
Springer
16 years 20 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
170
click to vote
SECON
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
173
click to vote
WAIM
2009
Springer
15 years 11 months ago
2009
Springer
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
169
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...