Sciweavers

1941 search results - page 287 / 389
» DNA Computing Approach to Construction of Semantic Model
Sort
View
143
Voted
KDD
1999
ACM
104views Data Mining» more  KDD 1999»
15 years 9 months ago
Learning Rules from Distributed Data
In this paper a concern about the accuracy (as a function of parallelism) of a certain class of distributed learning algorithms is raised, and one proposed improvement is illustrat...
Lawrence O. Hall, Nitesh V. Chawla, Kevin W. Bowye...
CONCUR
1999
Springer
15 years 9 months ago
From Synchrony to Asynchrony
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
Albert Benveniste, Benoît Caillaud, Paul Le ...
128
Voted
ACL
2010
15 years 3 months ago
On Jointly Recognizing and Aligning Bilingual Named Entities
We observe that (1) how a given named entity (NE) is translated (i.e., either semantically or phonetically) depends greatly on its associated entity type, and (2) entities within ...
Yufeng Chen, Chengqing Zong, Keh-Yih Su
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
14 years 14 days ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
HASKELL
2009
ACM
15 years 11 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...