Sciweavers

867 search results - page 134 / 174
» The Generalized Maximum Coverage Problem
Sort
View
GIS
2009
ACM
14 years 9 months ago
Efficient Viewpoint Assignment for Urban Texture Documentation
We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones parti...
Cyrus Shahabi, Farnoush Banaei Kashani, Houtan Shi...
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 8 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 8 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
SPAA
2004
ACM
14 years 1 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
IPSN
2004
Springer
14 years 1 months ago
Loss inference in wireless sensor networks based on data aggregation
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...
Gregory Hartl, Baochun Li