41472 search results - page 7746 / 8295 » is 2006 |
186
Voted
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
201
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
190
Voted
CTRSA
2007
Springer
16 years 1 months ago
2007
Springer
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
174
click to vote
ECTEL
2007
Springer
16 years 1 months ago
2007
Springer
In the paper an approach to analysis of the structure of repositories based on network analysis is proposed. The repository metadata can be transformed into several (one-mode or tw...
212
Voted
ER
2007
Springer
16 years 1 months ago
2007
Springer
The tutorial first addresses requirements and semantic problems to integrate digital information into large scale, meaningful networks of knowledge that support not only access to...