Sciweavers

1201 search results - page 39 / 241
» Linear Probing and Graphs
Sort
View
92
Voted
CCCG
2009
15 years 1 months ago
Relaxed Gabriel Graphs
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...
Prosenjit Bose, Jean Cardinal, Sébastien Co...
93
Voted
4OR
2007
103views more  4OR 2007»
15 years 18 days ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
15 years 7 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang
IJHPCA
2007
88views more  IJHPCA 2007»
15 years 12 days ago
Performance Optimization and Modeling of Blocked Sparse Kernels
We present a method for automatically selecting optimal implementations of sparse matrixvector operations. Our software ‘AcCELS’ (Accelerated Compress-storage Elements for Lin...
Alfredo Buttari, Victor Eijkhout, Julien Langou, S...
109
Voted
JDA
2006
85views more  JDA 2006»
15 years 13 days ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger