724 search results - page 103 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
126
click to vote
ESA
2004
Springer
15 years 8 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
131
click to vote
AAECC
2001
Springer
15 years 7 months ago
2001
Springer
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
116
click to vote
RTAS
1999
IEEE
15 years 7 months ago
1999
IEEE
Real-time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requ...
137
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
ASIACRYPT
2003
Springer
15 years 8 months ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...