Sciweavers

1819 search results - page 122 / 364
» Computability and Representations of the Zero Set
Sort
View
ICDM
2008
IEEE
141views Data Mining» more  ICDM 2008»
15 years 4 months ago
Scalable Tensor Decompositions for Multi-aspect Data Mining
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...
Tamara G. Kolda, Jimeng Sun
JMLR
2008
127views more  JMLR 2008»
14 years 10 months ago
Incremental Identification of Qualitative Models of Biological Systems using Inductive Logic Programming
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
Ashwin Srinivasan, Ross D. King
SPIN
2010
Springer
14 years 8 months ago
Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
Maja Pesic, Dragan Bosnacki, Wil M. P. van der Aal...
ICCS
2007
Springer
15 years 4 months ago
Using FCA for Encoding Closure Operators into Neural Networks
After decades of concurrent development of symbolic and connectionist methods, recent years have shown intensifying efforts of integrating those two paradigms. This paper contribu...
Sebastian Rudolph
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 1 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin