Sciweavers

2981 search results - page 270 / 597
» Answer Set Planning
Sort
View
260
Voted
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
16 years 5 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 5 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
16 years 4 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
15 years 11 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu
123
Voted
ATAL
2009
Springer
15 years 11 months ago
Resource allocation with answer-set programming
Multi-agent resource allocation is a growing area of research at the frontier between Economics and Computer Science. Despite the extensive theoretical work and raising number of ...
João Leite, José Júlio Alfere...