Sciweavers

941 search results - page 73 / 189
» The Parking Permit Problem
Sort
View
AAAI
2011
13 years 12 months ago
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
Christopher W. Geib, Robert P. Goldman
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
15 years 6 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
GLOBECOM
2006
IEEE
15 years 6 months ago
Analysis of Unfairness between TCP Uplink and Downlink Flows in Wi-Fi Hot Spots
Abstract— This paper focuses on the unfairness problem between TCP uplink and downlink flows in the 802.11 Wi-Fi hot spots and shows that the service is prone to be unfair. The ...
Eun-Chan Park, Dong-Young Kim, Chong-Ho Choi
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
15 years 5 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer