Sciweavers

2925 search results - page 110 / 585
» Information Complexity of Online Problems
Sort
View
HICSS
2007
IEEE
111views Biometrics» more  HICSS 2007»
16 years 22 days ago
An Empirical Analysis of Fraud Detection in Online Auctions: Credit Card Phantom Transaction
The online auction is a well-known business model that shows how business can be changed with the aid of new technologies. On the other hand, although the online auction allows bu...
Myungsin Chae, Seonyoung Shim, Hyungjun Cho, Byung...
SIGKDD
2008
138views more  SIGKDD 2008»
15 years 6 months ago
Learning preferences of new users in recommender systems: an information theoretic approach
Recommender systems are a nice tool to help nd items of interest from an overwhelming number of available items. Collaborative Filtering (CF), the best known technology for recomme...
Al Mamunur Rashid, George Karypis, John Riedl
INFOCOM
2007
IEEE
16 years 21 days ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
CORR
2002
Springer
108views Education» more  CORR 2002»
15 years 6 months ago
Vote Elicitation: Complexity and Strategy-Proofness
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
Vincent Conitzer, Tuomas Sandholm
CONCUR
2007
Springer
16 years 17 days ago
Pushdown Module Checking with Imperfect Information
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
Benjamin Aminof, Aniello Murano, Moshe Y. Vardi