Sciweavers

13603 search results - page 109 / 2721
» On the Complexity of Computing Treelength
Sort
View
PUC
2002
80views more  PUC 2002»
13 years 9 months ago
Overcoming the Lack of Screen Space on Mobile Computers
One difficulty for interface design on mobile computers is lack of screen space caused by their small size. This paper describes a small pilot study and two formal experiments tha...
Stephen A. Brewster
IJFCS
2010
92views more  IJFCS 2010»
13 years 6 months ago
Collapsing the Hierarchy of Parallel Computational Models
We investigate the computational power of parallel models with directed reconfigurable buses and with shared memory. Based on feasibility considerations present in the literature,...
Stefan D. Bruda, Yuanqiao Zhang
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 8 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
FSTTCS
2010
Springer
13 years 7 months ago
Computing Rational Radical Sums in Uniform TC^0
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
Paul Hunter, Patricia Bouyer, Nicolas Markey, Jo&e...
ICASSP
2011
IEEE
13 years 1 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...