2588 search results - page 101 / 518 » Applications of Kolmogorov complexity to computable model th... |
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
138
click to vote
IACR
2011
14 years 1 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
104
click to vote
SEKE
2004
Springer
15 years 7 months ago
2004
Springer
As application semantics becomes more complex and dynamic in IT systems, it is necessary to engineer the application semantics in its own lifecycle of development parallel to syste...
148
click to vote
TOG
2012
13 years 4 months ago
2012
We present an approach to synthesizing shapes from complex domains, by identifying new plausible combinations of components from existing shapes. Our primary contribution is a new...
147
Voted
TIP
2010
15 years 1 days ago
2010
—Salient areas in natural scenes are generally regarded as areas which the human eye will typically focus on, and finding these areas is the key step in object detection. In com...