Sciweavers

4255 search results - page 327 / 851
» On Learning Boolean Functions
Sort
View
PG
2003
IEEE
15 years 12 months ago
Dynamic Sculpting and Deformation of Point Set Surfaces
This paper presents a novel paradigm for point set surface editing, which takes advantages of the potential of implicit surfaces, the strength of physics based modeling techniques...
Xiaohu Guo, Hong Qin
DAC
1999
ACM
15 years 11 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
15 years 11 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski
TOOLS
1999
IEEE
15 years 11 months ago
Class Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
Daniel J. Buehrer, Chee-Hwa Lee
STACS
1997
Springer
15 years 10 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal