2168 search results - page 134 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
124
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
This article addresses a question regarding relevant information in a social media such as a wiki that can contain huge amount of text, written in slang or in natural language, wi...
133
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we propose two fast Total Variation (TV) based algorithms for image restoration by utilizing variational posterior distribution approximation. The unknown image and ...
140
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
135
Voted
AMC
2006
15 years 4 months ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
180
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...