Sciweavers

1055 search results - page 71 / 211
» Convex Factorization Machines
Sort
View
118
Voted
ICALT
2007
IEEE
15 years 4 months ago
Motivating Online Expertise-Sharing for Informal Learning: The Influence of Age and Tenure in Knowledge Organizations
This paper examines motivations of knowledge workers to contribute expertise to online knowledge repositories that support informal learning, and presents findings from both a sur...
David Huffaker, Jennifer Lai
ICML
2010
IEEE
15 years 1 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
108
Voted
DM
2007
98views more  DM 2007»
15 years 16 days ago
p-adic valuations and k-regular sequences
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Jason P. Bell
112
Voted
PODS
2005
ACM
85views Database» more  PODS 2005»
16 years 21 days ago
Relative risk and odds ratio: a data mining perspective
We are often interested to test whether a given cause has a given effect. If we cannot specify the nature of the factors involved, such tests are called model-free studies. There ...
Haiquan Li, Jinyan Li, Limsoon Wong, Mengling Feng...
111
Voted
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
15 years 9 months ago
Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step
─ In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay model. The algorithm utilizes Lagrangian relaxation with a fast gradient-based pre-...
Hiran Tennakoon, Carl Sechen