2446 search results - page 80 / 490 » Where am I |
CVPR
1996
IEEE
14 years 2 months ago
1996
IEEE
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
COMBINATORICS
2006
13 years 10 months ago
2006
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
COMGEO
2007
ACM
13 years 10 months ago
2007
ACM
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
ALGORITHMICA
2005
13 years 10 months ago
2005
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
SYNTHESE
2008
13 years 10 months ago
2008
This paper discusses the notion of necessity in the light of results from contemporary mathematical practice. Two descriptions of necessity are considered. According to the first, ...