Sciweavers

CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 10 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
BMCBI
2010
110views more  BMCBI 2010»
13 years 10 months ago
Improvements to previous algorithms to predict gene structure and isoform concentrations using Affymetrix Exon arrays
Background: Exon arrays provide a way to measure the expression of different isoforms of genes in an organism. Most of the procedures to deal with these arrays are focused on gene...
Miguel A. Anton, Ander Aramburu, Angel Rubio
APLAS
2010
ACM
13 years 10 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
SODA
2010
ACM
142views Algorithms» more  SODA 2010»
13 years 10 months ago
Speeding up random walks with neighborhood exploration
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
Petra Berenbrink, Colin Cooper, Robert Elsaesser, ...
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
13 years 10 months ago
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms
Ittai Abraham, Amos Fiat, Andrew Goldberg, Renato ...
SODA
2010
ACM
132views Algorithms» more  SODA 2010»
13 years 10 months ago
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees
Prasad Tetali, Juan Vera, Eric Vigoda, Linji Yang
TON
2008
120views more  TON 2008»
13 years 11 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
SAC
2008
ACM
13 years 11 months ago
A cost-driven approach to role engineering
In recent years role-based access control (RBAC) has been spreading within organizations. However, companies still have considerable difficulty migrating to this model, due to the...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
SAC
2008
ACM
13 years 11 months ago
Tag-aware recommender systems by fusion of collaborative filtering algorithms
Recommender Systems (RS) aim at predicting items or ratings of items that the user are interested in. Collaborative Filtering (CF) algorithms such as user- and item-based methods ...
Karen H. L. Tso-Sutter, Leandro Balby Marinho, Lar...