Sciweavers

2526 search results - page 18 / 506
» A New Algorithm for Answer Set Computation
Sort
View
SAC
2006
ACM
14 years 3 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 9 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 10 months ago
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
on Uncertain Data (Extended Abstract) Ming Hua Jian Pei Wenjie Zhang Xuemin Lin Simon Fraser University, Canada The University of New South Wales & NICTA {mhua, jpei}@cs.sfu.c...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
ICDE
2008
IEEE
194views Database» more  ICDE 2008»
14 years 10 months ago
P-Cube: Answering Preference Queries in Multi-Dimensional Space
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
Dong Xin, Jiawei Han
CIKM
2009
Springer
14 years 1 months ago
Answering XML queries using materialized views revisited
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
Xiaoying Wu, Dimitri Theodoratos, Wendy Hui Wang