Sciweavers

2376 search results - page 128 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DMDW
2000
93views Management» more  DMDW 2000»
13 years 9 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
SIGIR
2008
ACM
13 years 7 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
DAGSTUHL
2006
13 years 9 months ago
Computation of the Minimal Associated Primes
Abstract. We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation o...
Santiago Laplagne
COMGEO
2006
ACM
13 years 8 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
JCB
2006
140views more  JCB 2006»
13 years 7 months ago
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
Eran Halperin, Elad Hazan