Sciweavers

887 search results - page 150 / 178
» A Science of Reasoning
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 1 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
FOCS
1995
IEEE
15 years 1 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
RTA
1995
Springer
15 years 1 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
CAD
2006
Springer
14 years 10 months ago
A unified subdivision approach for multi-dimensional non-manifold modeling
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k 3. We first present a series of definitions to facilitate top...
Yu-Sung Chang, Hong Qin
IJMMS
2007
163views more  IJMMS 2007»
14 years 10 months ago
Beyond ontologies: Toward situated representations of scientific knowledge
: In information systems that support knowledge-discovery applications such as scientific exploration, reliance on highly structured ontologies as data-organization aids can be lim...
William Pike, Mark Gahegan