Sciweavers

252 search results - page 2 / 51
» On partitions of discrete boxes
Sort
View
JCAM
2010
84views more  JCAM 2010»
13 years 17 days ago
An interior-point method for large constrained discrete ill-posed problems
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
13 years 10 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
COMPGEOM
2000
ACM
13 years 10 months ago
Fast software for box intersections
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
Afra Zomorodian, Herbert Edelsbrunner
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
13 years 5 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
ICPR
2008
IEEE
14 years 6 days ago
Recognition of box-like objects by fusing cues of shape and edges
Boxes are the universal choice for packing, storage, and transportation. In this paper we propose a template-based algorithm for recognition of box-like objects, which is invarian...
Chia-Chih Chen, Jake K. Aggarwal