Sciweavers

11160 search results - page 399 / 2232
» Incompleteness in a General Setting
Sort
View
159
Voted
ICML
2007
IEEE
16 years 7 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
145
Voted
WWW
2008
ACM
16 years 7 months ago
Web page sectioning using regex-based template
This work aims to provide a novel, site-specific web page segmentation and section importance detection algorithm, which leverages structural, content, and visual information. The...
Rupesh R. Mehta, Amit Madaan
ARITH
1999
IEEE
15 years 11 months ago
Necessary and Sufficient Conditions for Parallel, Constant Time Conversion and Addition
This note presents necessary and sufficient conditions for parallel and constant time conversions from one digit-set into another, and thus also for constant time addition. In the...
Peter Kornerup
165
Voted
FOSSACS
2004
Springer
15 years 10 months ago
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan
SIGACT
2008
103views more  SIGACT 2008»
15 years 6 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke