Sciweavers

324 search results - page 62 / 65
» Robots make computer science personal
Sort
View
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
CORR
2008
Springer
152views Education» more  CORR 2008»
13 years 7 months ago
Characterizing User Mobility in Second Life
In this work we present a measurement study of user mobility in Second Life. We first discuss different techniques to collect user traces and then focus on results obtained using ...
Chi-Anh La, Pietro Michiardi
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...
AIM
2005
13 years 7 months ago
If Not Turing's Test, Then What?
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
Paul R. Cohen
VLDB
2002
ACM
193views Database» more  VLDB 2002»
13 years 7 months ago
REFEREE: An Open Framework for Practical Testing of Recommender Systems using ResearchIndex
Automated recommendation (e.g., personalized product recommendation on an ecommerce web site) is an increasingly valuable service associated with many databases--typically online ...
Dan Cosley, Steve Lawrence, David M. Pennock