356 search results - page 51 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
SIGIR
1998
ACM
13 years 11 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
MMAS
2011
Springer
13 years 2 months ago
2011
Springer
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...
ICALP
2004
Springer
14 years 29 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
SIAMAM
2000
13 years 7 months ago
2000
Hopf bifurcation theory for an oscillator subject to a weak feedback but a large delay is investigated for a specific laser system. The problem is motivated by semiconductor laser ...