Sciweavers

1887 search results - page 360 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
PACT
2005
Springer
14 years 1 months ago
Optimal Behavior of a Moving Creature in the Cellular Automata Model
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
Mathias Halbach, Rolf Hoffmann
FOCS
2000
IEEE
14 years 2 days ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
KDD
1994
ACM
125views Data Mining» more  KDD 1994»
13 years 11 months ago
Knowledge Discovery in Large Image Databases: Dealing with Uncertainties in Ground Truth
This paper discusses the problem of knowledge discovery in image databases with particular focus on the issues which arise when absolute ground truth is not available. It is often...
Padhraic Smyth, Michael C. Burl, Usama M. Fayyad, ...
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 6 hour ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
WWW
2004
ACM
14 years 8 months ago
Shilling recommender systems for fun and profit
Recommender systems have emerged in the past several years as an effective way to help people cope with the problem of information overload. One application in which they have bec...
Shyong K. Lam, John Riedl