3874 search results - page 707 / 775 » Approximation Algorithms for k-hurdle Problems |
137
click to vote
QEST
2007
IEEE
15 years 9 months ago
2007
IEEE
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
154
Voted
ROBOCOMM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
125
Voted
ADC
2007
Springer
15 years 9 months ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
125
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
124
Voted
ICB
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...