Sciweavers

805 search results - page 150 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
CP
2009
Springer
14 years 7 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey
IPPS
2005
IEEE
15 years 3 months ago
FROST: Revisited and Distributed
FROST (Fold Recognition-Oriented Search Tool) [6] is a software whose purpose is to assign a 3D structure to a protein sequence. It is based on a series of filters and uses a dat...
Vincent Poirriez, Rumen Andonov, Antoine Marin, Je...
CIKM
2008
Springer
14 years 12 months ago
Representative entry selection for profiling blogs
Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of ent...
Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun, Rong ...
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
14 years 11 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
CJ
2006
123views more  CJ 2006»
14 years 10 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...