Sciweavers

592 search results - page 116 / 119
» Crossing numbers of random graphs
Sort
View
JACM
2006
134views more  JACM 2006»
13 years 7 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
NETWORK
2007
234views more  NETWORK 2007»
13 years 6 months ago
Surveillance Wireless Sensor Networks: Deployment Quality Analysis
Surveillance wireless sensor networks are deployed at perimeter or border locations to detect unauthorized intrusions. For deterministic deployment of sensors, the quality of depl...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
PAMI
2007
185views more  PAMI 2007»
13 years 6 months ago
A Two-Level Generative Model for Cloth Representation and Shape from Shading
In this paper we present a two-level generative model for representing the images and surface depth maps of drapery and clothes. The upper level consists of a number of folds whic...
Feng Han, Song Chun Zhu
IPPS
2010
IEEE
13 years 5 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá
DC
2011
12 years 6 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young