271 search results - page 19 / 55 » Comparison of two interactive search refinement techniques |
141
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
153
Voted
TSMC
2011
14 years 10 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
108
Voted
VLDB
2001
ACM
15 years 8 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...
146
Voted
FAW
2008
Springer
15 years 5 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
138
Voted
INFOVIS
2005
IEEE
15 years 9 months ago
2005
IEEE
Parallel Coordinates are a powerful method for visualizing multidimensional data, however, with large data sets they can become cluttered and difficult to read. On the other hand...