Sciweavers

4137 search results - page 168 / 828
» On the number of matchings of a tree
Sort
View
WWW
2009
ACM
16 years 7 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...
DATE
2010
IEEE
190views Hardware» more  DATE 2010»
15 years 11 months ago
Ultra-high throughput string matching for Deep Packet Inspection
Deep Packet Inspection (DPI) involves searching a packet's header and payload against thousands of rules to detect possible attacks. The increase in Internet usage and growing...
Alan Kennedy, Xiaojun Wang, Zhen Liu, Bin Liu
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 7 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
QEST
2008
IEEE
16 years 28 days ago
A Parallel and Distributed Analysis Pipeline for Performance Tree Evaluation
Performance Trees are a unifying framework for the specification of performance queries involving measures and requirements. This paper describes an evaluation environment for Pe...
Darren K. Brien, Nicholas J. Dingle, William J. Kn...
EUSFLAT
2007
186views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Forest of Fuzzy Decision Trees and Their Application in Video Mining
One of the great challenges today is to index videos with high-level semantic concepts or features. The basis of our approach is to use a fuzzy decision trees (FDT) to construct t...
Marcin Detyniecki, Christophe Marsala