6740 search results - page 1184 / 1348 » An s -Hamiltonian Line Graph Problem |
134
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
124
click to vote
ISCA
2002
IEEE
15 years 9 months ago
2002
IEEE
Techniques for analyzing and improving memory referencing behavior continue to be important for achieving good overall program performance due to the ever-increasing performance g...
138
click to vote
ISCC
2002
IEEE
15 years 9 months ago
2002
IEEE
Higher layer protocols in wireless networks need to dynamically adapt to observed network response. The common approach is that each session employs end-to-end monitoring to estim...
141
click to vote
ECML
2001
Springer
15 years 8 months ago
2001
Springer
In many applications, modelling techniques are necessary which take into account the inherent variability of given data. In this paper, we present an approach to model class speciï...
134
click to vote
ICC
2000
IEEE
15 years 8 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...