4047 search results - page 252 / 810 » Some Properties and Some Problems on Set Functors |
172
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
142
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
189
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
165
click to vote
CINQ
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
159
click to vote
AIIA
2005
Springer
16 years 16 hour ago
2005
Springer
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...