Sciweavers

816 search results - page 146 / 164
» Abstract Barycentric Algebras
Sort
View
COOPIS
2004
IEEE
13 years 11 months ago
Comparing Approaches for Semantic Service Description and Matchmaking
Matching descriptions of user requirements against descriptions of service capabilities is crucial for the discovery of appropriate services for a given task. To improve the precis...
Sven Schade, Arnd Sahlmann, Michael Lutz, Florian ...
CP
2006
Springer
13 years 11 months ago
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
Cédric Pralet, Thomas Schiex, Gérard...
CSL
2006
Springer
13 years 11 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba
DEXA
2006
Springer
193views Database» more  DEXA 2006»
13 years 11 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
ECAI
2006
Springer
13 years 11 months ago
Automatic Generation of Implied Constraints
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
John Charnley, Simon Colton, Ian Miguel