Sciweavers

2542 search results - page 288 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CLUSTER
2008
IEEE
15 years 7 months ago
Active storage using object-based devices
—The increasing performance and decreasing cost of processors and memory are causing system intelligence to move from the CPU to peripherals such as disk drives. Storage system d...
Tina Miriam John, Anuradharthi Thiruvenkata Ramani...
97
Voted
IEEEPACT
2006
IEEE
15 years 6 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
95
Voted
ACCV
2006
Springer
15 years 6 months ago
Inducing Semantic Segmentation from an Example
Segmenting an image into semantically meaningful parts is a fundamental and challenging task in computer vision. Automatic methods are able to segment an image into coherent region...
Yaar Schnitman, Yaron Caspi, Daniel Cohen-Or, Dani...
COMPGEOM
2006
ACM
15 years 6 months ago
The predicates for the Voronoi diagram of ellipses
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
SPAA
2005
ACM
15 years 6 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi