Sciweavers

6142 search results - page 520 / 1229
» The Complexity of Partition Functions
Sort
View
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
15 years 9 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan
AAAI
2010
15 years 8 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
COLING
2008
15 years 8 months ago
Coreference Systems Based on Kernels Methods
Various types of structural information e.g., about the type of constructions in which binding constraints apply, or about the structure of names - play a central role in corefere...
Yannick Versley, Alessandro Moschitti, Massimo Poe...
HIS
2008
15 years 8 months ago
Automatic Circle Detection on Images with Annealed Differential Evolution
This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images. The algorithm is based on a hybrid technique composed of simul...
Swagatam Das, Sambarta Dasgupta, Arijit Biswas, Aj...
CRIWG
2003
15 years 8 months ago
Exploring Interaction Behaviour and Performance of Online Collaborative Learning Teams
Abstract. Studying and analysing the collaborative behaviour of online learning teams and how this behaviour is related and affects task performance is a complex process. This pap...
Thanasis Daradoumis, Fatos Xhafa, Joan Manuel Marq...