Sciweavers

630 search results - page 51 / 126
» Symbolic Domain Decomposition
Sort
View
142
Voted
EMSOFT
2007
Springer
15 years 9 months ago
The algebra of connectors: structuring interaction in BIP
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
Simon Bliudze, Joseph Sifakis
96
Voted
GI
2005
Springer
15 years 9 months ago
Web-based Extraction of Technical Features of Products
: We present a novel symbolic approach to extract domain-specific technical features of products from large German corpora. Our prototypical implementation extracts terms like “A...
Sebastian Schmidt, Herbert Stoyan
126
Voted
CL
2000
Springer
15 years 7 months ago
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
Tommi A. Junttila, Ilkka Niemelä
139
Voted
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 9 months ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao
ICCV
2007
IEEE
16 years 5 months ago
pLSA for Sparse Arrays With Tsallis Pseudo-Additive Divergence: Noise Robustness and Algorithm
We introduce the Tsallis divergence error measure in the context of pLSA matrix and tensor decompositions showing much improved performance in the presence of noise. The focus of ...
Tamir Hazan, Roee Hardoon, Amnon Shashua