Sciweavers

2526 search results - page 183 / 506
» A New Algorithm for Answer Set Computation
Sort
View
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 10 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
OTM
2010
Springer
15 years 4 months ago
A Context-Based Model for the Interpretation of Polysemous Terms
The problem of polysemy involves having terms, such as “truck”, that refer to multiple concepts in different contexts; and conversely, having the same concept referred to with...
Chrisa Tsinaraki, Yannis Velegrakis, Nadzeya Kiyav...
JOC
2007
94views more  JOC 2007»
15 years 6 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou...
PAM
2004
Springer
15 years 11 months ago
Measurements and Laboratory Simulations of the Upper DNS Hierarchy
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
Duane Wessels, Marina Fomenkov, Nevil Brownlee, Ki...
JUCS
2010
117views more  JUCS 2010»
15 years 4 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...