Sciweavers

3415 search results - page 459 / 683
» Lower bounds on kernelization
Sort
View
WINE
2007
Springer
120views Economy» more  WINE 2007»
16 years 19 days ago
False-Name-Proof Mechanisms for Hiring a Team
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
Atsushi Iwasaki, David Kempe, Yasumasa Saito, Mahy...
MOBICOM
2006
ACM
16 years 15 days ago
Broadcast capacity in multihop wireless networks
In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such th...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
FOCS
2005
IEEE
16 years 4 days ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
ICCV
2005
IEEE
16 years 4 days ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
16 years 4 days ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...