Sciweavers

2925 search results - page 96 / 585
» Information Complexity of Online Problems
Sort
View
AIL
2004
107views more  AIL 2004»
15 years 6 months ago
AI and the Conquest of Complexity in Law
The paper identi es some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...
L. Bibel
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 7 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
SIGMOD
2010
ACM
184views Database» more  SIGMOD 2010»
15 years 11 months ago
Load-balanced query dissemination in privacy-aware online communities
We propose a novel privacy-preserving distributed infrastructure in which data resides only with the publishers owning it. The infrastructure disseminates user queries to publishe...
Emiran Curtmola, Alin Deutsch, K. K. Ramakrishnan,...
CSE
2009
IEEE
15 years 11 months ago
Quantifying Utility and Trustworthiness for Advice Shared on Online Social Media
—The growing popularity of social media in recent years has resulted in the creation of an enormous amount of user-developed content. While information is readily available, ther...
Sai T. Moturu, Jian Yang, Huan Liu
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
15 years 11 months ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev