Sciweavers

840 search results - page 73 / 168
» A New Discriminative Kernel From Probabilistic Models
Sort
View
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 7 days ago
Structured entity identification and document categorization: two tasks with one joint model
Traditionally, research in identifying structured entities in documents has proceeded independently of document categorization research. In this paper, we observe that these two t...
Indrajit Bhattacharya, Shantanu Godbole, Sachindra...
WWW
2006
ACM
16 years 15 days ago
Finding visual concepts by web image mining
We propose measuring "visualness" of concepts with images on the Web, that is, what extent concepts have visual characteristics. This is a new application of "Web i...
Keiji Yanai, Kobus Barnard
CN
2007
129views more  CN 2007»
14 years 11 months ago
Machine-learnt versus analytical models of TCP throughput
We first study the accuracy of two well-known analytical models of the average throughput of long-term TCP flows, namely the so-called SQRT and PFTK models, and show that these ...
Ibtissam El Khayat, Pierre Geurts, Guy Leduc
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 12 months ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
14 years 10 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...