Sciweavers

1683 search results - page 304 / 337
» Game Theory Basics
Sort
View
160
Voted
FOCS
2008
IEEE
15 years 10 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICC
2007
IEEE
239views Communications» more  ICC 2007»
15 years 10 months ago
Measuring WCDMA and HSDPA Delay Characteristics with QoSMeT
—Quality of Service (QoS) is becoming increasingly important with the rise of multimedia applications (e.g., voice over IP (VoIP), video conferencing, online gaming, and Internet...
Jarmo Prokkola, Mikko Hanski, Marko Jurvansuu, Mil...
139
Voted
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
15 years 9 months ago
Achieving Shorter Search Times in Voice Conversion Using Interactive Evolution
We have already proposed using evolutionary computation to adjust the voice quality conversion parameters, and we have reported that this approach produces results that are not onl...
Yuji Sato
112
Voted
STACS
1992
Springer
15 years 7 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...
145
Voted
AVI
2008
15 years 6 months ago
Agent warp engine: formula based shape warping for networked applications
Computer visualization and networking have advanced dramatically over the last few years, partially driven by the exploding video game market. 3D hardware acceleration has reached...
Alexander Repenning, Andri Ioannidou