Sciweavers

791 search results - page 103 / 159
» Approximating the Maximum Sharing Problem
Sort
View
SSD
2005
Springer
108views Database» more  SSD 2005»
14 years 1 months ago
On Trip Planning Queries in Spatial Databases
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, G...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 1 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
ATAL
2006
Springer
13 years 11 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
BMCBI
2006
143views more  BMCBI 2006»
13 years 7 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
IFIP
2005
Springer
14 years 1 months ago
A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
R. Fletcher