1145 search results - page 178 / 229 » Discrete Green's Functions |
172
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
135
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
153
click to vote
MOBIHOC
2009
ACM
16 years 6 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
141
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
171
click to vote
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
The aim of this paper is to demonstrate Hermes, a robust framework capable of aiding a spatio-temporal database developer in modeling, constructing and querying a database with dyn...