257 search results - page 24 / 52 » On the Complexity of Computing Units in a Number Field |
CGF
2010
13 years 8 months ago
2010
With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remain...
ICUIMC
2009
ACM
14 years 3 months ago
2009
ACM
Although documents have hundreds of thousands of unique words, only a small number of words are significantly useful for intelligent services. For this reason, feature extraction ...
AISC
1998
Springer
14 years 26 days ago
1998
Springer
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
CVPR
1997
IEEE
14 years 10 months ago
1997
IEEE
A framework for learning parameterized models of optical flow from image sequences is presented. A class of motions is represented by a set of orthogonal basis flow fields that ar...