Sciweavers

1172 search results - page 36 / 235
» Constructions of generalized Sidon sets
Sort
View
SPAA
2010
ACM
15 years 21 hour ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
JANCL
2007
86views more  JANCL 2007»
14 years 11 months ago
Constructive knowledge: what agents can achieve under imperfect information
We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than ...
Wojciech Jamroga, Thomas Ågotnes
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
BMCBI
2006
128views more  BMCBI 2006»
14 years 12 months ago
New directions in biomedical text annotation: definitions, guidelines and corpus construction
Background: While biomedical text mining is emerging as an important research area, practical results have proven difficult to achieve. We believe that an important first step tow...
W. John Wilbur, Andrey Rzhetsky, Hagit Shatkay
LREC
2008
107views Education» more  LREC 2008»
15 years 1 months ago
The Construction and Evaluation of Word Space Models
Semantic similarity is a key issue in many computational tasks. This paper goes into the development and evaluation of two common ways of automatically calculating the semantic si...
Yves Peirsman, Simon De Deyne, Kris Heylen, Dirk G...