2996 search results - page 281 / 600 » Numberings and Randomness |
158
click to vote
EMMCVPR
2005
Springer
2005
Springer
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
16 years 7 days ago
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...
152
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
160
click to vote
APPROX
2004
Springer
16 years 3 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
186
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
175
click to vote
CSB
2003
IEEE
16 years 33 min ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...