Sciweavers

974 search results - page 52 / 195
» pairing 2010
Sort
View
ACL
2011
12 years 11 months ago
An Algorithm for Unsupervised Transliteration Mining with an Application to Word Alignment
We propose a language-independent method for the automatic extraction of transliteration pairs from parallel corpora. In contrast to previous work, our method uses no form of supe...
Hassan Sajjad, Alexander Fraser, Helmut Schmid
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Consistency, comprehensiveness, and compatibility of pathway databases
Background: It is necessary to analyze microarray experiments together with biological information to make better biological inferences. We investigate the adequacy of current bio...
Donny Soh, Difeng Dong, Yike Guo, Limsoon Wong
ECCC
2007
147views more  ECCC 2007»
13 years 7 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
PAIRING
2010
Springer
116views Cryptology» more  PAIRING 2010»
13 years 6 months ago
Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts
Lewko and Waters [Eurocrypt 2010] presented a fully secure HIBE with short ciphertexts. In this paper we show how to modify their construction to achieve anonymity. We prove the s...
Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano
BMCBI
2010
100views more  BMCBI 2010»
13 years 7 months ago
Efficiency clustering for low-density microarrays and its application to QPCR
Background: Pathway-targeted or low-density arrays are used more and more frequently in biomedical research, particularly those arrays that are based on quantitative real-time PCR...
Eric F. Lock, Ryan Ziemiecki, J. S. Marron, Dirk P...