Sciweavers

9659 search results - page 123 / 1932
» Points on Computable Curves
Sort
View
ICA3PP
2010
Springer
15 years 11 months ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
DSSCV
2005
Springer
16 years 1 days ago
Using Top-Points as Interest Points for Image Matching
We consider the use of so-called top-points for object retrieval. These points are based on scale-space and catastrophe theory, and are invariant under gray value scaling and offse...
Bram Platel, Evguenia Balmachnova, Luc Florack, Fr...
SIAMNUM
2010
114views more  SIAMNUM 2010»
15 years 1 months ago
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
Len Bos, Stefano De Marchi, Alvise Sommariva, Marc...
ASSETS
2008
ACM
15 years 8 months ago
Understanding pointing problems in real world computing environments
Understanding how pointing performance varies in real world computer use and over time can provide valuable insight about how systems should accommodate changes in pointing behavi...
Amy Hurst, Jennifer Mankoff, Scott E. Hudson
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
15 years 6 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey