Sciweavers

7930 search results - page 70 / 1586
» Greedy in Approximation Algorithms
Sort
View
226
Voted
EMMCVPR
2011
Springer
14 years 2 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
117
Voted
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 9 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
129
Voted
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
15 years 12 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
117
Voted
ECML
2003
Springer
15 years 7 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
108
Voted
DCC
2006
IEEE
16 years 2 months ago
On Efficient Quantizer Design for Robust Distributed Source Coding
This paper considers the design of efficient quantizers for a distributed source coding system. The information is encoded at independent terminals and transmitted across separate...
Ankur Saxena, Jayanth Nayak, Kenneth Rose