Sciweavers

15375 search results - page 3061 / 3075
» cans 2008
Sort
View
NN
2008
Springer
152views Neural Networks» more  NN 2008»
13 years 7 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
NN
2008
Springer
158views Neural Networks» more  NN 2008»
13 years 7 months ago
Improved mapping of information distribution across the cortical surface with the support vector machine
The early visual cortices represent information of several stimulus attributes, such as orientation and color. To understand the coding mechanisms of these attributes in the brain...
Youping Xiao, Ravi Rao, Guillermo A. Cecchi, Ehud ...
PE
2008
Springer
167views Optimization» more  PE 2008»
13 years 7 months ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi
SIGECOM
2008
ACM
220views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Better redistribution with inefficient allocation in multi-unit auctions with unit demand
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
Mingyu Guo, Vincent Conitzer
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
« Prev « First page 3061 / 3075 Last » Next »