Sciweavers

562 search results - page 74 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
ICDCS
2008
IEEE
15 years 4 months ago
Correlation-Aware Object Placement for Multi-Object Operations
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
Ming Zhong, Kai Shen, Joel I. Seiferas
CORR
2010
Springer
92views Education» more  CORR 2010»
14 years 9 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
15 years 1 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
ECCV
2006
Springer
15 years 11 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 4 months ago
SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services
Online video chat services such as Chatroulette, Omegle, and vChatter that randomly match pairs of users in video chat sessions are fast becoming very popular, with over a million...
Xinyu Xing, Yu-Li Liang, Hanqiang Cheng, Jianxun D...