1716 search results - page 327 / 344 » Proving Conditional Termination |
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
104
click to vote
DAS
2010
Springer
15 years 5 months ago
2010
Springer
Whole-book recognition is a document image analysis strategy that operates on the complete set of a book’s page images, attempting to improve accuracy by automatic unsupervised ...
111
Voted
AAECC
2001
Springer
15 years 5 months ago
2001
Springer
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
118
click to vote
ANTS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
127
click to vote
INFOCOM
1998
IEEE
15 years 4 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...