Sciweavers

3356 search results - page 570 / 672
» Determining Consensus Numbers
Sort
View
SADM
2010
196views more  SADM 2010»
13 years 4 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
SOICT
2010
13 years 4 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 1 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
ECCC
2011
204views ECommerce» more  ECCC 2011»
13 years 1 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
INFOCOM
2011
IEEE
13 years 1 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...