Sciweavers

705 search results - page 66 / 141
» Approximating Extended Answer Sets
Sort
View
FROCOS
2009
Springer
15 years 4 months ago
Combining Nonmonotonic Knowledge Bases with External Sources
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...
Thomas Eiter, Gerhard Brewka, Minh Dao-Tran, Micha...
ISAAC
2004
Springer
117views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Adaptive Spatial Partitioning for Multidimensional Data Streams
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
John Hershberger, Nisheeth Shrivastava, Subhash Su...
MST
2007
138views more  MST 2007»
14 years 9 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 10 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
15 years 11 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...