Sciweavers

94 search results - page 10 / 19
» Computability and Complexity Results for a Spatial Assertion...
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
CIKM
2008
Springer
13 years 9 months ago
Kernel methods, syntax and semantics for relational text categorization
Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categoriza...
Alessandro Moschitti
SIGIR
2008
ACM
13 years 7 months ago
Crosslingual location search
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
Tanuja Joshi, Joseph Joy, Tobias Kellner, Udayan K...
IPPS
1997
IEEE
13 years 11 months ago
Interoperability of Data Parallel Runtime Libraries
This paper describes a framework for providing the ability to use multiple specialized data parallel libraries and/or languages within a single application. The ability to use mul...
Guy Edjlali, Alan Sussman, Joel H. Saltz
CGF
2004
113views more  CGF 2004»
13 years 7 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...