The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
As mobile devices, such as laptops, PDAs or mobile phones, are getting more and more ubiquitous and are able to communicate with each other via wireless technologies, the paradigm...
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...
A complete understanding of transcriptional regulatory processes in the cell requires identification of transcription factor binding sites on a genomewide scale. Unfortunately, th...
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...