Sciweavers

3131 search results - page 383 / 627
» Generalized connection caching
Sort
View
CSUR
2004
91views more  CSUR 2004»
15 years 6 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
ML
1998
ACM
115views Machine Learning» more  ML 1998»
15 years 6 months ago
Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL
This paper is a case study of a machine aided knowledge discovery process within the general area of drug design. More speci cally, the paper describes a sequence of experiments in...
Paul W. Finn, Stephen Muggleton, David Page, Ashwi...
MST
2007
132views more  MST 2007»
15 years 6 months ago
Odometers on Regular Languages
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
Valérie Berthé, Michel Rigo
JMIV
2008
97views more  JMIV 2008»
15 years 6 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 5 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...