7228 search results - page 443 / 1446 » From Algorithmic to Subjective Randomness |
154
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
211
click to vote
ILP
2004
Springer
16 years 5 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
193
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. Computer vision algorithms for individual tasks such as object recognition, detection and segmentation have shown impressive results in the recent past. The next challeng...
184
click to vote
WG
1993
Springer
15 years 11 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
154
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...