881 search results - page 143 / 177 » A Model of Tolerance |
155
click to vote
IJCNLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
148
click to vote
PDCAT
2005
Springer
15 years 11 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
148
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
170
click to vote
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
184
click to vote
SRDS
2003
IEEE
15 years 10 months ago
2003
IEEE
We consider the problem of increasing the availability of shared data in peer-to-peer (P2P) systems so that users can access any content, regardless of the current subset of onlin...