Sciweavers

1051 search results - page 134 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
EMO
2009
Springer
219views Optimization» more  EMO 2009»
16 years 1 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
NIPS
2007
15 years 7 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun
BMCBI
2004
120views more  BMCBI 2004»
15 years 6 months ago
Optimal cDNA microarray design using expressed sequence tags for organisms with limited genomic information
Background: Expression microarrays are increasingly used to characterize environmental responses and hostparasite interactions for many different organisms. Probe selection for cD...
Yian A. Chen, David J. Mckillen, Shuyuan Wu, Matth...
PVLDB
2010
125views more  PVLDB 2010»
15 years 4 months ago
MapMerge: Correlating Independent Schema Mappings
One of the main steps towards integration or exchange of data is to design the mappings that describe the (often complex) relationships between the source schemas or formats and t...
Bogdan Alexe, Mauricio A. Hernández, Lucian...
ASPDAC
2001
ACM
102views Hardware» more  ASPDAC 2001»
15 years 10 months ago
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovs...