507 search results - page 101 / 102 » Computing Sparse Multiples of Polynomials |
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
ICAI
2004
13 years 7 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
NIPS
2004
13 years 7 months ago
2004
The computation of classical higher-order statistics such as higher-order moments or spectra is difficult for images due to the huge number of terms to be estimated and interprete...
ECOI
2007
13 years 5 months ago
2007
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
SIAMCOMP
2000
13 years 5 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...