603 search results - page 52 / 121 » A General Approximation Technique for Constrained Forest Pro... |
112
click to vote
AML
2008
15 years 1 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
225
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
96
Voted
SODA
1997
ACM
15 years 2 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
112
click to vote
DCC
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
127
click to vote
EMMCVPR
2005
Springer
15 years 7 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...