2043 search results - page 267 / 409 » Some Basics on Tolerances |
273
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
281
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
211
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
237
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Sharing structured data today requires standardizing upon a single schema, then mapping and cleaning all of the data. This results in a single queriable mediated data instance. Ho...
275
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...