Sciweavers

7103 search results - page 557 / 1421
» Program Generation and Components
Sort
View
ACL
1997
15 years 7 months ago
Choosing the Word Most Typical in Context Using a Lexical Co-Occurrence Network
This paper presents a partial solution to a component of the problem of lexical choice: choosing the synonym most typical, or expected, in context. We apply a new statistical appr...
Philip Edmonds
141
Voted
AMC
2007
112views more  AMC 2007»
15 years 6 months ago
Computing moments of free additive convolution of measures
This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants and the moments of measures without sophisticated programming...
Wlodzimierz Bryc
ENTCS
2007
95views more  ENTCS 2007»
15 years 6 months ago
Handshake Games
In this paper I present a game model for the semantical analysis of handshake circuits. I show how the model captures effectively the composition of circuits in an associative wa...
Luca Fossati
ANOR
2011
175views more  ANOR 2011»
15 years 1 months ago
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
Fred Glover, Lawrence H. Cox, Rahul Patil, James P...
ICIP
2005
IEEE
16 years 8 months ago
Countering oversegmentation in partitioning-based connectivities
A new theoretical development is presented for handling the over-segmentation problem in partitioning-based connected openings. The definition we propose treats singletons generat...
Georgios K. Ouzounis, Michael H. F. Wilkinson