Sciweavers

1576 search results - page 206 / 316
» Properties of Synthetic Optimization Problems
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 10 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
INFOCOM
2010
IEEE
13 years 8 months ago
When Watchdog Meets Coding
Abstract—In this paper, we study the problem of misbehavior detection in wireless networks . A commonly adopted approach is to utilize the broadcast nature of the wireless medium...
Guanfeng Liang, Rachit Agarwal, Nitin Vaidya
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
KDD
2009
ACM
208views Data Mining» more  KDD 2009»
14 years 10 months ago
A principled and flexible framework for finding alternative clusterings
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
Zijie Qi, Ian Davidson
CVPR
2000
IEEE
14 years 2 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein