Sciweavers

1884 search results - page 261 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
127
Voted
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 2 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
BMCBI
2008
89views more  BMCBI 2008»
15 years 2 months ago
R/parallel - speeding up bioinformatics analysis with R
Background: R is the preferred tool for statistical analysis of many bioinformaticians due in part to the increasing number of freely available analytical methods. Such methods ca...
Gonzalo Vera, Ritsert C. Jansen, Remo Suppi
FOCS
2002
IEEE
15 years 7 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
ISCA
2003
IEEE
150views Hardware» more  ISCA 2003»
15 years 7 months ago
Cyclone: A Broadcast-Free Dynamic Instruction Scheduler with Selective Replay
To achieve high instruction throughput, instruction schedulers must be capable of producing high-quality schedules that maximize functional unit utilization while at the same time...
Dan Ernst, Andrew Hamel, Todd M. Austin
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 29 days ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...