Zobrazeno 101 - 110
of 1 215
pro vyhledávání: '"Goel, Ashish"'
Similarity search methods are widely used as kernels in various machine learning applications. Nearest neighbor search (NNS) algorithms are often used to retrieve similar entries, given a query. While there exist efficient techniques for exact query
Externí odkaz:
http://arxiv.org/abs/1006.3514
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus on SALSA), on large-scale dynamically evolving social networks. We assum
Externí odkaz:
http://arxiv.org/abs/1006.2880
A graph G'(V,E') is an \eps-sparsification of G for some \eps>0, if every (weighted) cut in G' is within (1\pm \eps) of the corresponding cut in G. A celebrated result of Benczur and Karger shows that for every undirected graph G, an \eps-sparsificat
Externí odkaz:
http://arxiv.org/abs/1004.4915
Autor:
Goel, Ashish, Post, Ian
We study the single-sink buy-at-bulk problem with an unknown cost function. We wish to route flow from a set of demand nodes to a root node, where the cost of routing x total flow along an edge is proportional to f(x) for some concave, non-decreasing
Externí odkaz:
http://arxiv.org/abs/1004.2291
In this paper we consider the well-studied problem of finding a perfect matching in a d-regular bipartite graph on 2n nodes with m=nd edges. The best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes time O(m\sqrt{n}). In
Externí odkaz:
http://arxiv.org/abs/0909.3346
Autor:
Goel, Ashish, Post, Ian
We consider the single-source (or single-sink) buy-at-bulk problem with an unknown concave cost function. We want to route a set of demands along a graph to or from a designated root node, and the cost of routing x units of flow along an edge is prop
Externí odkaz:
http://arxiv.org/abs/0908.3740
We consider the well-studied problem of finding a perfect matching in $d$-regular bipartite graphs with $2n$ vertices and $m = nd$ edges. While the best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes $O(m \sqrt{n})$ tim
Externí odkaz:
http://arxiv.org/abs/0902.1617
Autor:
Vijayalekshmi, Balakrishnan, Kodiatte, Thomas, Amirtharaj, G, Christudoss, Pamela, Zachariah, Uday, Nellickal, Arun, Ramakrishna, Banumathi, Balasubramanian, Kunnisery, Eapen, C, Goel, Ashish
Publikováno v:
Gastroenterology, Hepatology & Endoscopy Practice; Jan-Mar2024, Vol. 4 Issue 1, p22-27, 6p
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time $O(mn)$, dates back to K\"{o}nig's work in 1916 (here $m=nd$ is the number of
Externí odkaz:
http://arxiv.org/abs/0811.2457
In the budgeted learning problem, we are allowed to experiment on a set of alternatives (given a fixed experimentation budget) with the goal of picking a single alternative with the largest possible expected payoff. Approximation algorithms for this
Externí odkaz:
http://arxiv.org/abs/0810.0558