Sciweavers

391 search results - page 4 / 79
» Sortabilities of Partition Properties
Sort
View
54
Voted
IMR
2003
Springer
15 years 2 months ago
Mesh Refinement Based on the 8-Tetrahedra Longest- Edge Partition
The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in terms of three consecutive edge bisections, the first one performed by the longest-edge. The ass...
Angel Plaza, Maria-Cecilia Rivara
ICPR
2008
IEEE
15 years 4 months ago
Incremental nested partition method
In this paper, we introduce an incremental nested partition algorithm for finding the inner structuralization of dynamic datasets. Here we use three partition criteria that allow...
Jyrko Correa-Morris, José Ruiz-Shulcloper, ...
89
Voted
DAC
2001
ACM
15 years 10 months ago
Watermarking Graph Partitioning Solutions
Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IP...
Gregory Wolfe, Jennifer L. Wong, Miodrag Potkonjak
85
Voted
JMLR
2010
225views more  JMLR 2010»
14 years 4 months ago
Hartigan's Method: k-means Clustering without Voronoi
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
Matus Telgarsky, Andrea Vattani
SRDS
2000
IEEE
15 years 1 months ago
An Investigation of Membership and Clique Avoidance in TTP/C
Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This...
Günther Bauer, Michael Paulitsch