Sciweavers

779 search results - page 21 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 10 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
VLDB
2001
ACM
94views Database» more  VLDB 2001»
14 years 21 hour ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
WEBNET
1996
13 years 9 months ago
Information fusion with ProFusion
: The explosive growth of the World Wide Web, and the resulting information overload, has led to a miniexplosion in World Wide Web search engines. This mini-explosion, in turn, led...
Susan Gauch, Guijun Wang
COMAD
2009
13 years 8 months ago
Information Integration: Challenges and Approaches
The problem of information integration is discussed in the context of answering a query over the web. Querying the web requires that information from different web and other sourc...
Sharma Chakravarthy