Sciweavers

4524 search results - page 347 / 905
» The Complexity of Global Constraints
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
ICIP
2005
IEEE
16 years 8 months ago
A dynamic Bezier curve model
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. K...
CODES
2002
IEEE
15 years 12 months ago
Hardware support for real-time embedded multiprocessor system-on-a-chip memory management
The aggressive evolution of the semiconductor industry — smaller process geometries, higher densities, and greater chip complexity — has provided design engineers the means to...
Mohamed Shalan, Vincent John Mooney III
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 11 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
EDBT
2004
ACM
268views Database» more  EDBT 2004»
16 years 7 months ago
DBDC: Density Based Distributed Clustering
Abstract. Clustering has become an increasingly important task in modern application domains such as marketing and purchasing assistance, multimedia, molecular biology as well as m...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle