Sciweavers

7167 search results - page 224 / 1434
» Answer Set Programming
Sort
View
WMPI
2004
ACM
14 years 3 months ago
Selective main memory compression by identifying program phase changes
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
Doron Nakar, Shlomo Weiss
CC
2005
Springer
153views System Software» more  CC 2005»
14 years 3 months ago
Completeness Analysis for Incomplete Object-Oriented Programs
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Jingling Xue, Phung Hua Nguyen
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 10 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 9 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
ICDE
2010
IEEE
217views Database» more  ICDE 2010»
14 years 4 months ago
Toward industrial-strength keyword search systems over relational data
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...
Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Nau...