Sciweavers

2944 search results - page 176 / 589
» Improving Bound Propagation
Sort
View
DCC
2008
IEEE
14 years 10 months ago
Partial ovoids and partial spreads in hermitian polar spaces
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...
Jan De Beule, Andreas Klein, Klaus Metsch, Leo Sto...
CVPR
2012
IEEE
12 years 24 days ago
Learning to localize detected objects
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
Qieyun Dai, Derek Hoiem
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
14 years 11 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
14 years 5 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
ESA
2003
Springer
106views Algorithms» more  ESA 2003»
14 years 3 months ago
Improved Competitive Guarantees for QoS Buffering
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...
Alexander Kesselman, Yishay Mansour, Rob van Stee