Sciweavers

1920 search results - page 141 / 384
» The Complexity of the A B C Problem
Sort
View
JMMA
2002
90views more  JMMA 2002»
15 years 6 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
CODES
2009
IEEE
15 years 11 months ago
A tuneable software cache coherence protocol for heterogeneous MPSoCs
In a multiprocessor system-on-chip (MPSoC) private caches introduce the cache coherence problem. Here, we target at heterogeneous MPSoCs with a network-on-chip (NoC). Existing har...
Frank E. B. Ophelders, Marco Bekooij, Henk Corpora...
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 10 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
CVPR
2004
IEEE
16 years 8 months ago
Recovering Human Body Configurations: Combining Segmentation and Recognition
The goal of this work is to take an image such as the one in Figure 1(a), detect a human figure, and localize his joints and limbs (b) along with their associated pixel masks (c)....
Greg Mori, Xiaofeng Ren, Alexei A. Efros, Jitendra...
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
16 years 3 months ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...