Sciweavers

2778 search results - page 75 / 556
» Limit complexities revisited
Sort
View
MICS
2010
123views more  MICS 2010»
14 years 10 months ago
On the Topology of Real Algebraic Plane Curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 10 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
TIP
2010
123views more  TIP 2010»
14 years 10 months ago
Optimizing Motion Compensated Prediction for Error Resilient Video Coding
—This paper is concerned with optimization of the motion compensated prediction framework to improve the error resilience of video coding for transmission over lossy networks. Fi...
Hua Yang, Kenneth Rose
ENTCS
2011
131views more  ENTCS 2011»
14 years 6 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
Ed Blakey
IEEECIT
2006
IEEE
15 years 5 months ago
A Complexity Metrics Set for Large-Scale Object-Oriented Software Systems
Although traditional software metrics have widely been applied to practical software projects, they have insufficient abilities to measure a large-scale system’s complexity at h...
Yutao Ma, Keqing He, Dehui Du, Jing Liu, Yulan Yan