Sciweavers

3422 search results - page 365 / 685
» Random Subset Optimization
Sort
View
EMMCVPR
2011
Springer
14 years 4 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
EWSN
2006
Springer
16 years 4 months ago
Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks
Nodes in sensor networks often encounter spatially-correlated contention, where multiple nodes in the same neighborhood all sense an event they need to transmit information about....
Kyle Jamieson, Hari Balakrishnan, Y. C. Tay
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
16 years 1 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
CIKM
2009
Springer
15 years 11 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
CISS
2008
IEEE
15 years 11 months ago
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
Peter Marbach