Sciweavers

254 search results - page 28 / 51
» Cartographic Generalization as a Combination of Representing...
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
CP
2006
Springer
13 years 11 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar
ESWS
2008
Springer
13 years 9 months ago
Concept Search: Semantics Enabled Syntactic Search
Abstract. Historically, information retrieval (IR) has followed two principally different paths that we call syntactic IR and semantic IR. In syntactic IR, terms are represented as...
Fausto Giunchiglia, Uladzimir Kharkevich, Ilya Zai...
ICFEM
2010
Springer
13 years 6 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 1 months ago
Unfolding Concurrent Well-Structured Transition Systems
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
Frédéric Herbreteau, Grégoire...