3405 search results - page 31 / 681 » Factoring Groups Efficiently |
179
Voted
CSDA
2008
15 years 5 months ago
2008
Group lasso is a natural extension of lasso and selects variables in a grouped manner. However, group lasso suffers from estimation inefficiency and selection inconsistency. To re...
183
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
162
click to vote
SIAMCOMP
2000
15 years 5 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
150
click to vote
NIPS
2001
15 years 7 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
162
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...