10608 search results - page 599 / 2122 » Complexity of O'Hara's Algorithm |
167
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose an importance weighting framework for actively labeling samples. This technique yields practical yet sound active learning algorithms for general loss functions. Experi...
122
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
163
click to vote
SUM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
168
click to vote
ICALP
2005
Springer
16 years 21 days ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
182
click to vote
ICCNMC
2005
Springer
16 years 21 days ago
2005
Springer
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...