Sciweavers

87 search results - page 7 / 18
» Roughness bounds in rough set operations
Sort
View
ALGORITHMICA
2010
88views more  ALGORITHMICA 2010»
14 years 9 months ago
Improved Bounds for Wireless Localization
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
DSN
2007
IEEE
15 years 3 months ago
R-Sentry: Providing Continuous Sensor Services against Random Node Failures
The success of sensor-driven applications is reliant on whether a steady stream of data can be provided by the underlying system. This need, however, poses great challenges to sen...
Shengchao Yu, Yanyong Zhang
CVPR
2009
IEEE
3784views Computer Vision» more  CVPR 2009»
16 years 4 months ago
What is the Spatial Extent of an Object?
This paper discusses the question: Can we improve the recognition of objects by using their spatial context? We start from Bag-of-Words models and use the Pascal 2007 dataset. We u...
Arnold W. M. Smeulders, Jasper R. R. Uijlings, Rem...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
15 years 2 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon