Sciweavers

479 search results - page 43 / 96
» Supporting OpenMP on Cell
Sort
View
IWCMC
2006
ACM
15 years 3 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
ISPD
2004
ACM
97views Hardware» more  ISPD 2004»
15 years 3 months ago
Implementation and extensibility of an analytic placer
Automated cell placement is a critical problem in VLSI physical design. New analytical placement methods that simultaneously spread cells and optimize wirelength have recently rec...
Andrew B. Kahng, Qinke Wang
SAC
2004
ACM
15 years 3 months ago
A method to define an Enterprise Architecture using the Zachman Framework
The proliferation of IT and its consequent dispersion is an enterprise reality, however, most organizations do not have adequate tools and/or methodologies that enable the managem...
Carla Marques Pereira, Pedro Sousa
JAC
2008
14 years 11 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
CORR
2010
Springer
249views Education» more  CORR 2010»
14 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder