14548 search results - page 2868 / 2910 » The Optimal Path-Matching Problem |
231
Voted
CIKM
2009
Springer
16 years 4 days ago
2009
Springer
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
205
click to vote
CP
2001
Springer
16 years 58 min ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
186
Voted
VLDB
2001
ACM
15 years 12 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
215
Voted
FOCS
2000
IEEE
15 years 12 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
193
click to vote
ICC
2000
IEEE
15 years 12 months ago
2000
IEEE
fixed rate coding in terms of SNR and average throughput was obtained. In fact, the concept of variable rate adaptive In this paper, we propose a bandwidth efficient error cor- cod...