Sciweavers

2570 search results - page 274 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
CVPR
1999
IEEE
16 years 4 months ago
Algebraic Curves That Work Better
An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or su...
David B. Cooper, Jean-Philippe Tarel, Tolga Tasdiz...
105
Voted
ACMSE
2006
ACM
15 years 9 months ago
Inductive bases and their application to searches for minimal unary NFAs
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
Geoffrey Smith
GD
2005
Springer
15 years 9 months ago
Incremental Connector Routing
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
Michael Wybrow, Kim Marriott, Peter J. Stuckey
GRAPHICSINTERFACE
2009
15 years 1 months ago
Recognizing interspersed sketches quickly
Sketch recognition is the automated recognition of hand-drawn diagrams. When allowing users to sketch as they would naturally, users may draw shapes in an interspersed manner, sta...
Tracy Anne Hammond, Randall Davis
143
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 3 months ago
The discrete Fourier transform: A canonical basis of eigenfunctions
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen