Sciweavers

2944 search results - page 254 / 589
» Improving Bound Propagation
Sort
View
JGT
2010
113views more  JGT 2010»
15 years 5 months ago
Crossing numbers of imbalanced graphs
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...
János Pach, József Solymosi, G&aacut...
CVPR
2011
IEEE
15 years 2 months ago
A Segmentation-aware Object Detection Model with Occlusion Handling
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...
Tianshi Gao, Benjamin Packer, Daphne Koller
TIT
2011
102views more  TIT 2011»
15 years 1 months ago
Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters
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...
Kai-Uwe Schmidt
ICALP
2011
Springer
14 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
CIMCA
2008
IEEE
16 years 1 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis