Sciweavers

265 search results - page 27 / 53
» et 2000
Sort
View
AAAI
2000
13 years 9 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
CACM
2000
94views more  CACM 2000»
13 years 7 months ago
Abstract Class Hierarchies, Factories, and Stable Designs
Class Hierarchies, Factories, and Stable Designs M uch of the debate about the general aptness of class hierarchies is rooted in the different objectives taxonomists and implemente...
Friedrich Steimann
CN
2000
80views more  CN 2000»
13 years 7 months ago
An entropy approach to unintrusive targeted advertising on the Web
This paper describes the formulation of a new model for unintrusive targeted advertising on the web, extending the linear programming approach taken by Langheinrich et al.[10] A f...
John A. Tomlin
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
13 years 7 months ago
A Note on the Non-Colorability Threshold of a Random Graph
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C....
TOG
2002
127views more  TOG 2002»
13 years 7 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers