Sciweavers

1099 search results - page 183 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
SI3D
2005
ACM
15 years 3 months 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...
IPPS
2000
IEEE
15 years 2 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
FOCS
1999
IEEE
15 years 2 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
CONEXT
2009
ACM
14 years 11 months ago
SWARM: the power of structure in community wireless mesh networks
Community wireless networks (CWNs) have been proposed to spread broadband network access to underprivileged, underprovisioned and remote areas. Research has focused on optimizing ...
Saumitra M. Das, Konstantina Papagiannaki, Suman B...
CCE
2005
14 years 9 months ago
Selecting maximally informative genes
Microarray experiments are emerging as one of the main driving forces in modern biology. By allowing the simultaneous monitoring of the expression of the entire genome for a given...
Ioannis P. Androulakis