Sciweavers

1068 search results - page 5 / 214
» Factorization as a Rank 1 Problem
Sort
View
ICFP
1999
ACM
15 years 2 months ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
Atsushi Ohori, Nobuaki Yoshida
70
Voted
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 9 months ago
Nonnegative Matrix Factorization via Rank-One Downdate
Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a produ...
Michael Biggs, Ali Ghodsi, Stephen A. Vavasis
IJAC
2007
116views more  IJAC 2007»
14 years 9 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
BMCBI
2005
104views more  BMCBI 2005»
14 years 9 months ago
Scoring functions for transcription factor binding site prediction
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
Markus T. Friberg, Peter von Rohr, Gaston H. Gonne...
AIRWEB
2005
Springer
15 years 3 months ago
An Analysis of Factors Used in Search Engine Ranking
This paper investigates the influence of different page features on the ranking of search engine results. We use Google (via its API) as our testbed and analyze the result rankin...
Albert Bifet, Carlos Castillo, Paul-Alexandru Chir...