Sciweavers

2436 search results - page 71 / 488
» Comonadic Notions of Computation
Sort
View
126
Voted
AML
1999
86views more  AML 1999»
15 years 3 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
139
Voted
MP
2011
14 years 6 months ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng
130
Voted
CCGRID
2001
IEEE
15 years 7 months ago
Data Staging Effects in Wide Area Task Farming Applications
Recent advances in computing and communication have given rise to the computational grid notion. The core of this computing paradigm is the design of a system for drawing compute ...
Wael R. Elwasif, James S. Plank, Richard Wolski
154
Voted
COLING
2010
14 years 10 months ago
Near-synonym Lexical Choice in Latent Semantic Space
We explore the near-synonym lexical choice problem using a novel representation of near-synonyms and their contexts in the latent semantic space. In contrast to traditional latent...
Tong Wang, Graeme Hirst
COLING
2010
14 years 10 months ago
Tree Topological Features for Unlexicalized Parsing
As unlexicalized parsing lacks word token information, it is important to investigate novel parsing features to improve the accuracy. This paper studies a set of tree topological ...
Samuel W. K. Chan, Lawrence Y. L. Cheung, Mickey W...