Sciweavers

252 search results - page 46 / 51
» On partitions of discrete boxes
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 5 months ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor
COMPGEOM
2004
ACM
14 years 1 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
SPAA
1993
ACM
13 years 11 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
ECTEL
2007
Springer
14 years 1 months ago
Network Analysis of Repositories
In the paper an approach to analysis of the structure of repositories based on network analysis is proposed. The repository metadata can be transformed into several (one-mode or tw...
Vladimir Batagelj, Iztok Kavkler, Matija Lokar
COMPGEOM
2007
ACM
13 years 11 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir