932 search results - page 57 / 187 » Where in the Wikipedia Is That Answer |
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
FQ
2003
Springer
14 years 3 months ago
2003
Springer
We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] < ∞. We...
DEXAW
2002
IEEE
14 years 3 months ago
2002
IEEE
We present a method to index objects moving on the plane in order to efficiently answer range queries about their position in the future. This problem is motivated by real-life a...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Tuning a system to an operating environment calls for experimentation, and a question that arises naturally is: how many experiments are needed to come up with a system meeting...
ISW
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?...