552 search results - page 68 / 111 » On the Complexity of Join Predicates |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
INTERSENSE
2006
ACM
14 years 1 months ago
2006
ACM
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
BMCBI
2004
13 years 7 months ago
2004
Background: The exploitation of information extraction (IE), a technology aiming to provide instances of structured representations from free-form text, has been rapidly growing w...
PODS
2005
ACM
14 years 7 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...
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Previous studies indicate that the expected effects of e-Government are slower to realize than initially expected. Several authors argue that e-Government involves particularly co...