Sciweavers

17329 search results - page 3088 / 3466
» Improved non-approximability results
Sort
View
SPAA
2005
ACM
16 years 11 days ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
VEE
2005
ACM
143views Virtualization» more  VEE 2005»
16 years 11 days ago
Optimized interval splitting in a linear scan register allocator
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems’ Java HotSpotTM client compiler. Linear scan register allocation is ...
Christian Wimmer, Hanspeter Mössenböck
AI
2005
Springer
16 years 11 days ago
Instance Cloning Local Naive Bayes
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
Liangxiao Jiang, Harry Zhang, Jiang Su
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
16 years 11 days ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
ASIACRYPT
2005
Springer
16 years 11 days ago
A Practical Attack on the Fixed RC4 in the WEP Mode
In this paper we revisit a known but ignored weakness of the RC4 keystream generator, where secret state info leaks to the generated keystream, and show that this leakage, also kno...
Itsik Mantin
« Prev « First page 3088 / 3466 Last » Next »