7988 search results - page 215 / 1598 » A Useful Undecidable Theory |
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract— The sparse nature of location finding problem makes the theory of compressive sensing desirable for indoor positioning in Wireless Local Area Networks (WLANs). In this...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
VLDB
2003
ACM
14 years 11 months ago
2003
ACM
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
PODS
2005
ACM
14 years 11 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
TACAS
2009
Springer
14 years 5 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...