Sciweavers

14518 search results - page 37 / 2904
» Two Problems for Sophistication
Sort
View
SPAA
2003
ACM
14 years 28 days ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 1 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
PR
2008
144views more  PR 2008»
13 years 7 months ago
Kernel quadratic discriminant analysis for small sample size problem
It is generally believed that quadratic discriminant analysis (QDA) can better fit the data in practical pattern recognition applications compared to linear discriminant analysis ...
Jie Wang, Konstantinos N. Plataniotis, Juwei Lu, A...
ICMCS
2006
IEEE
119views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Design and Verification of Communication Protocols for Peer-to-Peer Multimedia Systems
This paper addresses issues pertaining to the necessity of utilizing formal verification methods in the design of protocols for peer-to-peer multimedia systems. These systems req...
Senem Velipasalar, Chang Hong Lin, Jason Schlessma...
CHES
2003
Springer
115views Cryptology» more  CHES 2003»
14 years 28 days ago
The Doubling Attack - Why Upwards Is Better than Downwards
The recent developments of side channel attacks have lead implementers to use more and more sophisticated countermeasures in critical operations such as modular exponentiation, or ...
Pierre-Alain Fouque, Frédéric Valett...