Sciweavers

11160 search results - page 382 / 2232
» Incompleteness in a General Setting
Sort
View
EJC
2008
15 years 6 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
RECOMB
2006
Springer
16 years 7 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
ICTAI
2003
IEEE
16 years 3 days ago
Integrating Microarray Data by Consensus Clustering
With the exploding volume of microarray experiments comes increasing interest in mining repositories of such data. Meaningfully combining results from varied experiments on an equ...
Vladimir Filkov, Steven Skiena
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 8 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
EWCBR
2004
Springer
16 years 6 days ago
Knowledge-Intensive Case-Based Reasoning in CREEK
Knowledge-intensive CBR assumes that cases are enriched with general domain knowledge. In CREEK, there is a very strong coupling between cases and general domain knowledge, in that...
Agnar Aamodt