552 search results - page 68 / 111 » On the Complexity of Join Predicates |
128
click to vote
CORR
2010
Springer
14 years 7 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...
107
click to vote
INTERSENSE
2006
ACM
15 years 6 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 ...
115
Voted
BMCBI
2004
15 years 15 days 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...
89
Voted
PODS
2005
ACM
16 years 23 days 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...
88
Voted
HICSS
2006
IEEE
15 years 6 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...