Sciweavers

7123 search results - page 206 / 1425
» The Ordered Set of Rough Sets
Sort
View
DM
2006
135views more  DM 2006»
15 years 6 months ago
Berge's conjecture on directed path partitions - a survey
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Irith Ben-Arroyo Hartman
DAGSTUHL
2006
15 years 8 months ago
Enriched categories and models for spaces of dipaths
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
Timothy Porter
CVPR
2009
IEEE
3784views Computer Vision» more  CVPR 2009»
17 years 1 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...
AAAI
1993
15 years 7 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
16 years 20 hour 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