14548 search results - page 330 / 2910 » The Optimal Path-Matching Problem |
172
click to vote
AAAI
2012
13 years 9 months ago
2012
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
174
click to vote
PVLDB
2008
15 years 6 months ago
2008
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...
185
click to vote
RFIDSEC
2010
15 years 5 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
173
click to vote
CONEXT
2010
ACM
15 years 4 months ago
2010
ACM
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...
167
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...