Sciweavers

10414 search results - page 296 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
MST
2010
117views more  MST 2010»
15 years 1 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
IJNSEC
2006
131views more  IJNSEC 2006»
15 years 6 months ago
A Frobenius Map Approach for an Efficient and Secure Multiplication on Koblitz
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier ...
Mustapha Hedabou
ICIP
2006
IEEE
16 years 8 months ago
Efficient 2-D Gray-Scale Dilations and Erosions with Arbitrary Flat Structuring Elements
An efficient algorithm is presented for the computation of gray-scale morphological operations with 2-D structuring elements (S.E.). The required computing time is independent of ...
Erik R. Urbach, Michael H. F. Wilkinson
PODS
2006
ACM
98views Database» more  PODS 2006»
16 years 6 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch
ASIACRYPT
2001
Springer
15 years 10 months ago
An Efficient Implementation of Braid Groups
We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual...
Jae Choon Cha, Ki Hyoung Ko, Sangjin Lee, Jae Woo ...