4103 search results - page 392 / 821 » Some results on the Collatz problem |
188
click to vote
IJISEC
2007
15 years 6 months ago
2007
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
166
click to vote
ICALP
2003
Springer
16 years 1 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
223
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
192
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
294
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...