Sciweavers

1418 search results - page 142 / 284
» Schema polynomials and applications
Sort
View
FOSSACS
2011
Springer
14 years 9 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
13 years 8 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 6 months ago
Synthesizing structured text from logical database subsets
In the classical database world, information access has been based on a paradigm that involves structured, schema-aware, queries and tabular answers. In the current environment, h...
Alkis Simitsis, Georgia Koutrika, Yannis Alexandra...
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
15 years 11 months ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
APWEB
2007
Springer
15 years 10 months ago
DBMSs with Native XML Support: Towards Faster, Richer, and Smarter Data Management
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
Min Wang