Sciweavers

5964 search results - page 1191 / 1193
» A theory of speculative computation
Sort
View
SIGCOMM
2012
ACM
11 years 9 months ago
Perspectives on network calculus: no free lunch, but still good value
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
Florin Ciucu, Jens Schmitt
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 9 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
SIGIR
2012
ACM
11 years 9 months ago
An uncertainty-aware query selection model for evaluation of IR systems
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
Mehdi Hosseini, Ingemar J. Cox, Natasa Milic-Frayl...
SIGIR
2012
ACM
11 years 9 months ago
Explicit relevance models in intent-oriented information retrieval diversification
The intent-oriented search diversification methods developed in the field so far tend to build on generative views of the retrieval system to be diversified. Core algorithm compon...
Saul Vargas, Pablo Castells, David Vallet
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 9 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
« Prev « First page 1191 / 1193 Last » Next »