Sciweavers

1871 search results - page 131 / 375
» The Ephemeral Pairing Problem
Sort
View
95
Voted
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
15 years 6 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
MLG
2007
Springer
15 years 5 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 11 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
72
Voted
ICIP
2000
IEEE
16 years 1 months ago
Efficiently Estimating Projective Transformations
Projective transformations relate the coordinates of images that are taken by either a camera that undergoes only rotation while imaging an arbitrary scene, or one that rotates an...
Richard J. Radke, Peter J. Ramadge, Tomio Echigo, ...
103
Voted
ICCSA
2007
Springer
15 years 5 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi