696 search results - page 15 / 140 » A class of combinatorial identities |
142
click to vote
IWCIA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
121
click to vote
EUROCRYPT
2009
Springer
16 years 2 months ago
2009
Springer
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
133
click to vote
SOFSEM
2000
Springer
15 years 5 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
116
click to vote
ECOOP
2007
Springer
15 years 8 months ago
2007
Springer
Object-oriented languages define the identity of an object to be an address-based object identifier. The programmer may customize the notion of object identity by overriding the ...
117
click to vote
AI
2006
Springer
15 years 2 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...