Sciweavers

526 search results - page 23 / 106
» Increments of Random Partitions
Sort
View
EURODAC
1995
IEEE
112views VHDL» more  EURODAC 1995»
14 years 2 hour ago
On implementation choices for iterative improvement partitioning algorithms
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
Lars W. Hagen, Dennis J.-H. Huang, Andrew B. Kahng
PG
2003
IEEE
14 years 1 months ago
Breaking the Walls: Scene Partitioning and Portal Creation
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
Alon Lerner, Yiorgos Chrysanthou, Daniel Cohen-Or
ASC
2008
13 years 8 months ago
Dynamic data assigning assessment clustering of streaming data
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
Olga Georgieva, Frank Klawonn
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
14 years 8 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
EGH
2004
Springer
14 years 1 months ago
Mio: fast multipass partitioning via priority-based instruction scheduling
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
Andrew Riffel, Aaron E. Lefohn, Kiril Vidimce, Mar...