Sciweavers

20066 search results - page 3749 / 4014
» T Spaces
Sort
View
189
Voted
OOPSLA
2009
Springer
15 years 11 months ago
Good examples for exposing bad practice: a "killer examples" workshop
The “Killer Examples” series of workshops are highly interactive workshops which have been an annual occurrence at OOPSLA since 2002. The goals of the workshop are to bring to...
Dale Skrien, Michael E. Caspersen, Jürgen B&o...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 11 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
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 ...
Hans Georg Schaathun
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
15 years 11 months ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...
CCS
2001
ACM
15 years 11 months ago
Interoperable strategies in automated trust negotiation
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...
Ting Yu, Marianne Winslett, Kent E. Seamons
CCS
2001
ACM
15 years 11 months ago
Practical forward secure group signature schemes
A group signature scheme allows a group member to sign messages anonymously on behalf of the group, while in case of a dispute, a designated entity can reveal the identity of a si...
Dawn Xiaodong Song
« Prev « First page 3749 / 4014 Last » Next »