Sciweavers

9842 search results - page 1445 / 1969
» Problem complexity
Sort
View
SI3D
2005
ACM
16 years 22 days ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
HIPC
2004
Springer
16 years 16 days ago
Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction
Parasitic extraction techniques are used to estimate signal delay in VLSI chips. Inductance extraction is a critical component of the parasitic extraction process in which on-chip ...
Hemant Mahawar, Vivek Sarin, Ananth Grama
DAC
2003
ACM
16 years 12 days ago
4G terminals: how are we going to design them?
Fourth-generation wireless communication systems (4G) will have totally different requirements than what front-end designers have been coping with up to now. Designs must be targe...
Jan Craninckx, Stéphane Donnay
SSIAI
2000
IEEE
15 years 11 months ago
Pairwise Markov Random Fields and its Application in Textured Images Segmentation
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...
Wojciech Pieczynski, Abdel-Nasser Tebbache
EUROPAR
1999
Springer
15 years 11 months ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...
« Prev « First page 1445 / 1969 Last » Next »