68 search results - page 4 / 14 » Obtaining Quick Results for Approximate Answers |
SIAMCOMP
2000
13 years 7 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
ICDE
2009
IEEE
13 years 5 months ago
2009
IEEE
Online forums contain huge amounts of valuable user-generated content. In current forum systems, users have to passively wait for other users to visit the forum systems and read/an...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
TSMC
2010
13 years 2 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...