Sciweavers

1052 search results - page 180 / 211
» Mean-Variance Analysis of the Performance of Spatial Orderin...
Sort
View
CP
2003
Springer
14 years 28 days ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
EEE
2004
IEEE
13 years 11 months ago
A Methodology to Find Web Site Keywords
For many companies and/or institutions it is no longer sufficient to have a web site and high quality products or services. What in many cases makes the difference between success...
Juan D. Velásquez, Richard Weber, Hiroshi Y...
ICMLA
2007
13 years 9 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
BMCBI
2010
110views more  BMCBI 2010»
13 years 7 months ago
Concept-based query expansion for retrieving gene related publications from MEDLINE
Background: Advances in biotechnology and in high-throughput methods for gene analysis have contributed to an exponential increase in the number of scientific publications in thes...
Sérgio Matos, Joel Arrais, João Maia...
TIT
2010
144views Education» more  TIT 2010»
13 years 2 months ago
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
Enrico Paolini, Marc P. C. Fossorier, Marco Chiani