3602 search results - page 233 / 721 » Isn't It About Time |
IV
2009
IEEE
15 years 7 months ago
2009
IEEE
Re-finding previously viewed Web pages in browsing histories is often a difficult task, due to the incomplete and vague knowledge people have about the information they are seek...
112
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
93
Voted
ESWS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Finding the optimal selection of an OWL reasoner and service interface for a specific ontology-based application is challenging. Over time it has become more and more di...
79
Voted
INDOCRYPT
2009
Springer
15 years 7 months ago
2009
Springer
This paper investigates a new family of RFID protocols called Ff that grew out of a proposal made at ESORICS 2007. This family has the property of having highly efficient implement...
124
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...