Sciweavers

163 search results - page 13 / 33
» Optimal Correspondences from Pairwise Constraints
Sort
View
SIGMOD
2003
ACM
150views Database» more  SIGMOD 2003»
16 years 17 days ago
Capturing both Types and Constraints in Data Integration
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juli...
167
Voted
PAMI
2012
13 years 2 months ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
MP
2002
195views more  MP 2002»
15 years 2 days ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
91
Voted
BMCBI
2004
120views more  BMCBI 2004»
15 years 8 days 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...
98
Voted
ICCV
2011
IEEE
14 years 13 days ago
A Convex Framework for Image Segmentation with Moment Constraints
Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentati...
Maria Klodt, Daniel Cremers