2715 search results - page 134 / 543 » Total Generalized Variation |
130
click to vote
PC
2010
15 years 1 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
104
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
This work proposes a novel cautious surfer to incorporate trust into the process of calculating authority for web pages. We evaluate a total of sixty queries over two large, real-...
115
click to vote
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
115
click to vote
ORL
1998
15 years 2 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
177
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...