Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
The desire for definitive data and the semantic web drive for inference over heterogeneous data sources requires co-reference resolution to be performed on those data. In particul...
Significant progress has been made in terrestrial sensor networks to revolutionize sensing and data collection. To bring the concept of long-lived, dense sensor networks to the u...
Refactorings are program transformations which should preserve the program behavior. Consequently, we expect that during phases when there are mostly refactorings in the change hi...
For many years it has been commonly held that a user who adds structural “hints” to a query will improve precision in an element retrieval search. At INEX 2005 we conducted an...