Sciweavers

417 search results - page 12 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
70
Voted
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
15 years 3 months ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
FOCS
2009
IEEE
15 years 4 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
ICML
2009
IEEE
15 years 4 months ago
Independent factor topic models
Topic models such as Latent Dirichlet Allocation (LDA) and Correlated Topic Model (CTM) have recently emerged as powerful statistical tools for text document modeling. In this pap...
Duangmanee Putthividhya, Hagai Thomas Attias, Srik...
ASAP
2002
IEEE
85views Hardware» more  ASAP 2002»
15 years 2 months ago
Predictable Instruction Caching for Media Processors
The determinism of instruction cache performance can be considered a major problem in multi-media devices which hope to maximise their quality of service. If instructions are evic...
James Irwin, David May, Henk L. Muller, Dan Page
JCO
2000
116views more  JCO 2000»
14 years 9 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta