Sciweavers

2168 search results - page 405 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
BMCBI
2004
125views more  BMCBI 2004»
13 years 7 months ago
A functional hierarchical organization of the protein sequence space
Background: It is a major challenge of computational biology to provide a comprehensive functional classification of all known proteins. Most existing methods seek recurrent patte...
Noam Kaplan, Moriah Friedlich, Menachem Fromer, Mi...
TIT
2002
98views more  TIT 2002»
13 years 7 months ago
DC-free binary convolutional coding
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
Tadashi Wadayama, A. J. Han Vinck
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
12 years 10 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
MOBICOM
2009
ACM
14 years 2 months ago
Data fusion improves the coverage of wireless sensor networks
Wireless sensor networks (WSNs) have been increasingly available for critical applications such as security surveillance and environmental monitoring. An important performance mea...
Guoliang Xing, Rui Tan, Benyuan Liu, Jianping Wang...
ASIACRYPT
2004
Springer
14 years 1 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan