Sciweavers

170 search results - page 27 / 34
» A Simple Greedy Algorithm for the k-Disjoint Flow Problem
Sort
View
EMMCVPR
2011
Springer
12 years 7 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 8 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
13 years 11 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
LCPC
1997
Springer
13 years 11 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
TWC
2008
140views more  TWC 2008»
13 years 7 months ago
Exclusive-Region Based Scheduling Algorithms for UWB WPAN
With the capability of supporting very high data rate services in a short range, Ultra-Wideband (UWB) technology is appealing to multimedia applications in future wireless personal...
Kuang-Hao Liu, Lin Cai, Xuemin Shen