Sciweavers

756 search results - page 36 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
AI
1999
Springer
13 years 7 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 9 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
JSAT
2006
91views more  JSAT 2006»
13 years 8 months ago
Extending Existential Quantification in Conjunctions of BDDs
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
Sean Weaver, John V. Franco, John S. Schlipf
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
14 years 3 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 8 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...