Sciweavers

85 search results - page 8 / 17
» Improved Algorithms for Uniform Partitions of Points
Sort
View
IJCGA
1998
74views more  IJCGA 1998»
14 years 9 months ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
JSS
2007
121views more  JSS 2007»
14 years 9 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...
APCSAC
2005
IEEE
15 years 3 months ago
An Integrated Partitioning and Scheduling Based Branch Decoupling
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate th...
Pramod Ramarao, Akhilesh Tyagi
APWEB
2005
Springer
15 years 3 months ago
Indexing Text and Visual Features for WWW Images
In this paper, we present a novel indexing technique called Multi-scale Similarity Indexing (MSI) to index image’s multi-features into a single one-dimensional structure. Both f...
Heng Tao Shen, Xiaofang Zhou, Bin Cui
PRL
2008
135views more  PRL 2008»
14 years 9 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa