986 search results - page 191 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
STOC
2010
ACM
14 years 14 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
High power consumption will shorten battery life for handheld devices and cause thermal and reliability problems. One way to lower the dynamic power consumption is to reduce the s...
ICDCS
2000
IEEE
14 years 9 hour ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...