Sciweavers

455 search results - page 68 / 91
» Dynamic well-spaced point sets
Sort
View
CIKM
2000
Springer
15 years 2 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
BMCBI
2007
137views more  BMCBI 2007»
14 years 9 months ago
PlnTFDB: an integrative plant transcription factor database
Background: Transcription factors (TFs) are key regulatory proteins that enhance or repress the transcriptional rate of their target genes by binding to specific promoter regions ...
Diego Mauricio Riaño-Pachón, Sloboda...
LFP
1992
140views more  LFP 1992»
14 years 11 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
COMPGEOM
2003
ACM
15 years 3 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
COMPGEOM
2010
ACM
15 years 2 months ago
Kinetic stable Delaunay graphs
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 ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...