Sciweavers

15254 search results - page 23 / 3051
» A k
Sort
View
NIPS
1998
13 years 11 months ago
A High Performance k-NN Classifier Using a Binary Correlation Matrix Memory
This paper presents a novel and fast k-NN classifier that is based on a binary CMM (Correlation Matrix Memory) neural network. A robust encoding method is developed to meet CMM in...
Ping Zhou, Jim Austin, John Kennedy
AIPS
2009
13 years 11 months ago
The Influence of k-Dependence on the Complexity of Planning
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
Omer Giménez, Anders Jonsson
LOGCOM
2000
93views more  LOGCOM 2000»
13 years 9 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
13 years 9 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
MLDM
2010
Springer
13 years 4 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran