Sciweavers

35 search results - page 6 / 7
» On shortest paths in line arrangements
Sort
View
ICCI
1991
13 years 9 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
13 years 11 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
ICCV
2007
IEEE
14 years 8 months ago
Novel Depth Cues from Uncalibrated Near-field Lighting
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
ARITH
2005
IEEE
13 years 8 months ago
Quasi-Pipelined Hash Circuits
Hash functions are an important cryptographic primitive. They are used to obtain a fixed-size fingerprint, or hash value, of an arbitrary long message. We focus particularly on ...
Marco Macchetti, Luigi Dadda
3DPVT
2006
IEEE
224views Visualization» more  3DPVT 2006»
14 years 6 days ago
A Bayesian Approach to Building Footprint Extraction from Aerial LIDAR Data
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are ofte...
Oliver Wang, Suresh K. Lodha, David P. Helmbold