Sciweavers

146 search results - page 12 / 30
» Formulating context-dependent similarity functions
Sort
View
CANDC
2002
ACM
14 years 9 months ago
A model for information technologies that can be creative
To contribute to HCI investigation and interface design that develops interactive systems for creative solutions, I attempt to formulate a model of the human capability to combine...
Johan F. Hoorn
70
Voted
PR
2002
81views more  PR 2002»
14 years 9 months ago
Generalised correlation for multi-feature correspondence
Computing correspondences between pairs of images is fundamental to all structures from motion algorithms. Correlation is a popular method to estimate similarity between patches o...
C. V. Jawahar, P. J. Narayanan
78
Voted
ICML
2007
IEEE
15 years 10 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
15 years 6 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
86
Voted
TCC
2005
Springer
113views Cryptology» more  TCC 2005»
15 years 3 months ago
Entropic Security and the Encryption of High Entropy Messages
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of ...
Yevgeniy Dodis, Adam Smith