Sciweavers

1921 search results - page 356 / 385
» The Student-Project Allocation Problem
Sort
View
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...
SIGIR
2008
ACM
13 years 7 months ago
Learning to reduce the semantic gap in web image retrieval and annotation
We study in this paper the problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based imag...
Changhu Wang, Lei Zhang 0001, Hong-Jiang Zhang
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 8 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
EDBT
2006
ACM
179views Database» more  EDBT 2006»
14 years 7 months ago
TrajPattern: Mining Sequential Patterns from Imprecise Trajectories of Mobile Objects
Abstract. Mobile objects have become ubiquitous in our everyday lives, ranging from cellular phones to sensors, therefore, analyzing and mining mobile data becomes an interesting p...
Jiong Yang, Meng Hu
ICFP
2006
ACM
14 years 7 months ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield