Sciweavers

2584 search results - page 253 / 517
» On the Forward Checking Algorithm
Sort
View
DALT
2008
Springer
15 years 4 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
CVPR
2007
IEEE
16 years 5 months ago
Influence of numerical conditioning on the accuracy of relative orientation
We study the influence of numerical conditioning on the accuracy of two closed-form solutions to the overconstrained relative orientation problem. We consider the well known eight...
Sinisa Segvic, Gerald Schweighofer, Axel Pinz
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
15 years 9 months ago
Adding Semantics to Email Clustering
This paper presents a novel algorithm to cluster emails according to their contents and the sentence styles of their subject lines. In our algorithm, natural language processing t...
Hua Li, Dou Shen, Benyu Zhang, Zheng Chen, Qiang Y...
ACISP
2007
Springer
15 years 7 months ago
A New Strategy for Finding a Differential Path of SHA-1
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 6 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams