2479 search results - page 452 / 496 » Quantum complexity theory |
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract. Denial-of-Service (DoS) attacks remain a challenging problem in the Internet. In a DoS attack the attacker is attempting to make a resource unavailable to its intended le...
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper we develop a theory of metamodules and an associated distributed asynchronous planner which generalizes previous work on metamodules for lattice-based modular rob...