Sciweavers

8810 search results - page 1449 / 1762
» Openness
Sort
View
SIGIR
2012
ACM
13 years 9 months ago
Building reputation and trust using federated search and opinion mining
The term online reputation addresses trust relationships amongst agents in dynamic open systems. These can appear as ratings, recommendations, referrals and feedback. Several repu...
Somayeh Khatiban
SIGIR
2012
ACM
13 years 9 months ago
Evaluating aggregated search pages
Aggregating search results from a variety of heterogeneous sources or verticals such as news, image and video into a single interface is a popular paradigm in web search. Although...
Ke Zhou, Ronan Cummins, Mounia Lalmas, Joemon M. J...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
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 ...
Petr Kolman, Christian Scheideler
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
13 years 9 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
« Prev « First page 1449 / 1762 Last » Next »