Sciweavers

789 search results - page 118 / 158
» On Theory Revision with Queries
Sort
View
94
Voted
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 25 days ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 7 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
86
Voted
ATAL
2007
Springer
15 years 6 months ago
Scaling-up shopbots: a dynamic allocation-based approach
In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in dema...
David Sarne, Sarit Kraus, Takayuki Ito
112
Voted
CLEF
2007
Springer
15 years 6 months ago
Multiplying Concept Sources for Graph Modeling
This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the langua...
Loïc Maisonnasse, Éric Gaussier, Jean-...
105
Voted
PLDI
2005
ACM
15 years 6 months ago
Composing security policies with polymer
We introduce a language and system that supports definition and composition of complex run-time security policies for Java applications. Our policies are comprised of two sorts o...
Lujo Bauer, Jay Ligatti, David Walker