806 search results - page 140 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
TVLSI
2008
13 years 7 months ago
2008
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
JCO
2011
13 years 2 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...