Sciweavers

1888 search results - page 290 / 378
» Proof theory and computational analysis
Sort
View
CSUR
2004
91views more  CSUR 2004»
14 years 11 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
ICPR
2010
IEEE
14 years 9 months ago
The Good, the Bad, and the Ugly: Predicting Aesthetic Image Labels
Automatic classification of the aesthetic content of a picture is one of the challenges in the emerging discipline of computational aesthetics. Any suitable solution must cope wit...
Yaowen Wu, Christian Bauckhage, Christian Thurau
SIGCOMM
2012
ACM
13 years 2 months ago
Route shepherd: stability hints for the control plane
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
WWW
2008
ACM
16 years 16 days ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
COMPGEOM
2009
ACM
15 years 6 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir