Sciweavers

17366 search results - page 198 / 3474
» New Revision Algorithms
Sort
View
STOC
2005
ACM
103views Algorithms» more  STOC 2005»
16 years 4 months ago
New and improved constructions of non-malleable cryptographic protocols
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
Rafael Pass, Alon Rosen
WEA
2010
Springer
338views Algorithms» more  WEA 2010»
15 years 11 months ago
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi
ICASSP
2008
IEEE
15 years 11 months ago
Average case analysis of sparse recovery with thresholding : New bounds based on average dictionary coherence
This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabi...
Mohammad Golbabaee, Pierre Vandergheynst
ICPR
2008
IEEE
15 years 11 months ago
A new courtesy amount recognition module of a Check Reading System
A new courtesy amount recognition module of CENPARMI’s Check Reading System (CRS) is proposed in this paper. The module consists of 3 main segments: pre-processing, segmentation...
Wu Ding, Ching Y. Suen, Adam Krzyzak
SMC
2007
IEEE
103views Control Systems» more  SMC 2007»
15 years 10 months ago
A new evaluation measure for information retrieval systems
Abstract— Some of the established approaches to evaluating text clustering algorithms for information retrieval show theoretical flaws. In this paper, we analyze these flaws an...
Martin Mehlitz, Christian Bauckhage, Jér&oc...