2095 search results - page 149 / 419 » Improved pebbling bounds |
167
click to vote
JGT
2010
15 years 4 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
211
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
The bounding box representation employed by many popular object detection models [3, 6] implicitly assumes all pixels inside the box belong to the object. This assumption makes th...
159
click to vote
TIT
2011
15 years 1 months ago
2011
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...
149
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
171
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...