1697 search results - page 300 / 340 » On Bayesian Case Matching |
148
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
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...
147
Voted
JCAM
2011
14 years 5 months ago
2011
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
147
click to vote
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
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...
164
Voted
AIME
2011
Springer
14 years 2 months ago
2011
Springer
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...
183
Voted
Publication
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...