Sciweavers

2168 search results - page 192 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
13 years 6 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
WWW
2009
ACM
16 years 5 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
PRL
2007
138views more  PRL 2007»
15 years 4 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh
ICML
2004
IEEE
16 years 5 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
PIMRC
2008
IEEE
15 years 10 months ago
Distributed digital locked loops for time/frequency locking in packet-based wireless communication
— In infrastructure-less wireless systems network-wise time and frequency synchronization can be achieved by exchanging mutual synchronization errors among neighboring nodes. Coo...
Umberto Spagnolini, Nicola Varanese, Osvaldo Simeo...