Sciweavers

2111 search results - page 77 / 423
» Understanding the Yarowsky Algorithm
Sort
View
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
15 years 2 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
STOC
1996
ACM
197views Algorithms» more  STOC 1996»
15 years 1 months ago
Computing Betti Numbers via Combinatorial Laplacians
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
Joel Friedman
ANTS
2008
Springer
57views Algorithms» more  ANTS 2008»
14 years 11 months ago
Functorial Properties of Stark Units in Multiquadratic Extensions
Abstract. The goal of this paper is to present computations investigating the "functorial" properties of Stark units, that is, how specific roots of Stark units from cert...
Jonathan W. Sands, Brett A. Tangedal
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
14 years 11 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
CIKM
2009
Springer
15 years 4 months ago
Topic and keyword re-ranking for LDA-based topic modeling
Topic-based text summaries promise to help average users quickly understand a text collection and derive insights. Recent research has shown that the Latent Dirichlet Allocation (...
Yangqiu Song, Shimei Pan, Shixia Liu, Michelle X. ...