Sciweavers

3690 search results - page 111 / 738
» Computation with classical sequents
Sort
View
STACS
2012
Springer
13 years 5 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
AFRICACRYPT
2010
Springer
15 years 4 months ago
Flexible Group Key Exchange with On-demand Computation of Subgroup Keys
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
Michel Abdalla, Céline Chevalier, Mark Manu...
APGV
2010
ACM
266views Visualization» more  APGV 2010»
15 years 1 months ago
Horizon estimation: perceptual and computational experiments
The human visual system is able to quickly and robustly infer a wealth of scene information – the scene "gist" – already after 100 milliseconds of image presentation...
Christian Herdtweck, Christian Wallraven
BMCBI
2008
132views more  BMCBI 2008»
14 years 10 months ago
Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
Raffaele Giancarlo, Davide Scaturro, Filippo Utro
TCS
2008
14 years 9 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman