Sciweavers

2754 search results - page 32 / 551
» Distributed Weighted Matching
Sort
View
ICDAR
2011
IEEE
12 years 8 months ago
An Improved Method Based on Weighted Grid Micro-structure Feature for Text-Independent Writer Recognition
: Writer recognition is a very important branch of biometrics. In our previous research, a Grid Micro-structure Feature (GMSF) based text-independent and scriptindependent method w...
Lu Xu, Xiaoqing Ding, Liangrui Peng, Xin Li
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 6 months ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...
PCM
2010
Springer
179views Multimedia» more  PCM 2010»
13 years 6 months ago
3D Similarity Search Using a Weighted Structural Histogram Representation
A fast and robust 3D retrieval method is proposed based on a novel weighted structural histogram representation. Our method has the following steps: 1) adaptively segment any 3D sh...
Tong Lu, Rongjun Gao, Tuantuan Wang, Yubin Yang
NIPS
2008
13 years 10 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
JGAA
2000
179views more  JGAA 2000»
13 years 8 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao