Sciweavers

485 search results - page 64 / 97
» Weighted Factorization
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
BMCBI
2006
129views more  BMCBI 2006»
13 years 8 months ago
BIPAD: A web server for modeling bipartite sequence elements
Background: Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences sepa...
Chengpeng Bi, Peter K. Rogan
COGCOM
2010
107views more  COGCOM 2010»
13 years 5 months ago
Where to Look Next? Combining Static and Dynamic Proto-objects in a TVA-based Model of Visual Attention
To decide ``Where to look next ?'' is a central function of the attention system of humans, animals and robots. Control of attention depends on three factors, that is, lo...
Marco Wischnewski, Anna Belardinelli, Werner X. Sc...
PAMI
2012
11 years 10 months ago
A Least-Squares Framework for Component Analysis
— Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Lap...
Fernando De la Torre
ICCV
2009
IEEE
15 years 27 days ago
Level Set Segmentation with Both Shape and Intensity Priors
We present a new variational level-set-based segmentation formulation that uses both shape and intensity prior information learned from a training set. By applying Bayes’ rule...
Siqi Chen and Richard J. Radke