Sciweavers

2526 search results - page 83 / 506
» A New Algorithm for Answer Set Computation
Sort
View
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
15 years 8 months ago
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
118
Voted
HCI
2009
15 years 5 days ago
User Reputation Evaluation Using Co-occurrence Feature and Collective Intelligence
It becomes more difficult to find valuable contents in the Web 2.0 environment since lots of inexperienced users provide many unorganized contents. In the previous researches, peop...
Jeong-Won Cha, Hyun-woo Lee, Yo-Sub Han, Laehyun K...
ISCI
2010
211views more  ISCI 2010»
15 years 26 days ago
A new heuristic approach for non-convex optimization problems
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
Rosario Toscano, Patrick Lyonnet
CIARP
2004
Springer
15 years 7 months ago
Refined Method for the Fast and Exact Computation of Moment Invariants
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
Juan Humberto Sossa Azuela, Jan Flusser
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 6 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas