Sciweavers

4714 search results - page 17 / 943
» The Complexity of Iterated Multiplication
Sort
View
JCSS
2002
55views more  JCSS 2002»
13 years 9 months ago
Uniform constant-depth threshold circuits for division and iterated multiplication
William Hesse, Eric Allender, David A. Mix Barring...
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 7 months ago
Unsupervised discovery of repetitive objects
We present a novel approach for unsupervised discovery of repetitive objects from 3D point clouds. Our method assumes that objects are geometrically consistent, and uses multiple o...
Jiwon Shin, Rudolph Triebel, Roland Siegwart
ICCD
2007
IEEE
121views Hardware» more  ICCD 2007»
14 years 6 months ago
Fast power network analysis with multiple clock domains
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
Wanping Zhang, Ling Zhang, Rui Shi, He Peng, Zhi Z...
CVPR
2012
IEEE
12 years 5 days ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
14 years 2 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett