Sciweavers

20197 search results - page 249 / 4040
» Comparing Computational Power
Sort
View
MM
2004
ACM
109views Multimedia» more  MM 2004»
16 years 3 hour ago
Practical voltage scaling for mobile multimedia devices
This paper presents the design, implementation, and evaluation of a practical voltage scaling (PDVS) algorithm for mobile devices primarily running multimedia applications. PDVS s...
Wanghong Yuan, Klara Nahrstedt
JGAA
2007
135views more  JGAA 2007»
15 years 6 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ATAL
2007
Springer
16 years 23 days ago
Embedding Landmarks and Scenes in a Computational Model of Institutions
Over the last decade, institutions have demonstrated that they are a powerful mechanism to make agent interactions more effective, structured, coordinated and efficient. Different...
Owen Cliffe, Marina De Vos, Julian A. Padget
ASIACRYPT
2005
Springer
16 years 3 days ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
SIAMNUM
2010
87views more  SIAMNUM 2010»
15 years 1 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer