Sciweavers

192 search results - page 34 / 39
» On-Demand Bound Computation for Best-First Constraint Optimi...
Sort
View
90
Voted
IPPS
2009
IEEE
15 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
15 years 6 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
LCN
2008
IEEE
15 years 4 months ago
Delay constrained placement of mobile data collectors in underwater acoustic sensor networks
—We propose a scheme for routing and placement of mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). The proposed scheme maximizes the lifetime of the network...
Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
14 years 11 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
VC
2011
106views more  VC 2011»
14 years 4 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002