Sciweavers

876 search results - page 31 / 176
» New Results for the Martin Polynomial
Sort
View
STACS
1997
Springer
14 years 24 days ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
DSN
2002
IEEE
14 years 1 months ago
32-Bit Cyclic Redundancy Codes for Internet Applications
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
Philip Koopman
ISCAS
2007
IEEE
133views Hardware» more  ISCAS 2007»
14 years 2 months ago
Volterra Analysis Using Chebyshev Series
— The paper presents a new approach to the Volterra analysis of analog circuits. This kind of analysis is widely used for the calculation of distortion and intermodulation produc...
Ioannis Sarkas, Dimitrios Mavridis, Michail Papami...
FOCS
2009
IEEE
14 years 3 months ago
Smoothed Analysis of Multiobjective Optimization
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
Heiko Röglin, Shang-Hua Teng