Sciweavers

315 search results - page 16 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
15 years 2 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
FOCS
2006
IEEE
15 years 3 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
CVPR
2010
IEEE
15 years 5 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
EGH
2010
Springer
14 years 7 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
ACL
2012
12 years 12 months ago
A Comprehensive Gold Standard for the Enron Organizational Hierarchy
Many researchers have attempted to predict the Enron corporate hierarchy from the data. This work, however, has been hampered by a lack of data. We present a new, large, and freel...
Apoorv Agarwal, Adinoyi Omuya, Aaron Harnly, Owen ...