Sciweavers

2100 search results - page 232 / 420
» Fundamentals of the problem
Sort
View
SIGMETRICS
2002
ACM
105views Hardware» more  SIGMETRICS 2002»
15 years 5 months ago
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
Mark S. Squillante, Yanyong Zhang, Anand Sivasubra...
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 8 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 11 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
IJCV
1998
105views more  IJCV 1998»
15 years 5 months ago
Robust Algorithms for Object Localization
Object localization using sensed data features and corresponding model features is a fundamental problem in machine vision. We reformulate object localization as a least squares p...
Aaron S. Wallack, Dinesh Manocha
SIGPRO
2010
122views more  SIGPRO 2010»
15 years 3 months ago
Parameter estimation for exponential sums by approximate Prony method
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
Daniel Potts, Manfred Tasche