Sciweavers

1188 search results - page 237 / 238
» Extended Graph Unification
Sort
View
JSYML
2010
107views more  JSYML 2010»
13 years 4 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
PVLDB
2010
82views more  PVLDB 2010»
13 years 4 months ago
Record Linkage with Uniqueness Constraints and Erroneous Values
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
Songtao Guo, Xin Dong, Divesh Srivastava, Remi Zaj...
ECEASST
2010
13 years 3 months ago
Safe Integration of Annotated Components in Open Source Projects
: The decision of using existing software components versus building from scratch custom software is one of the most complex and important choices of the entire development/integra...
Sergio Areias, Daniela Carneiro da Cruz, Pedro Ran...
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 1 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
DAM
2011
13 years 1 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire