Sciweavers

1697 search results - page 300 / 340
» On Bayesian Case Matching
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Integer representations of convex polygon intersection graphs
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
Tobias Müller, Erik Jan van Leeuwen, Jan van ...
JCAM
2011
78views more  JCAM 2011»
12 years 11 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters
ICCV
2011
IEEE
12 years 8 months ago
BRISK: Binary Robust Invariant Scalable Keypoints
Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Establishe...
Stefan Leutenegger, Margarita Chli, Roland Y. Sieg...
AIME
2011
Springer
12 years 8 months ago
Diagnosis Code Assignment Support Using Random Indexing of Patient Records - A Qualitative Feasibility Study
Abstract. The prediction of diagnosis codes is typically based on freetext entries in clinical documents. Previous attempts to tackle this problem range from strictly rule-based sy...
Aron Henriksson, Martin Hassel, Maria Kvist

Publication
151views
11 years 12 months ago
Can faces verify blood-relations?
Humans can verify unknown parent-offspring and sibling pairs over unrelated subject pairs. A computational scheme to accomplish the task robustly, in the presence of challenges due...
Gowri Somanath, Chandra Kambhamettu