Sciweavers

13041 search results - page 245 / 2609
» Simulating space and time
Sort
View
RECOMB
2001
Springer
16 years 6 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
CVPR
2010
IEEE
1790views Computer Vision» more  CVPR 2010»
16 years 2 months ago
Data Driven Mean-Shift Belief Propagation For non-Gaussian MRFs
We introduce a novel data-driven mean-shift belief propagation (DDMSBP) method for non-Gaussian MRFs, which often arise in computer vision applications. With the aid of scale sp...
Minwoo Park, S. Kashyap, R. Collins, and Y. Liu
ICC
2009
IEEE
127views Communications» more  ICC 2009»
16 years 1 months ago
Dynamic Coexistence of Frequency Hopping Networks Using Parallel and Gaussian Allocations
Abstract—This paper studies the coexistence of several independent and dynamic wireless networks using the frequency hopping technique in the unlicensed radio band. We propose a ...
Mohammad Masud Hasan, Ravi Prakash, Jason P. Jue
CLUSTER
2008
IEEE
16 years 22 days ago
A comparison of search heuristics for empirical code optimization
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
Keith Seymour, Haihang You, Jack Dongarra
ICC
2008
IEEE
176views Communications» more  ICC 2008»
16 years 21 days ago
Reliable Transport with Memory Consideration in Wireless Sensor Networks
—Wireless sensor networks are often composed of resource-constrained sensor nodes with limited memory space, computational capacity and communication range. The links in WSN are ...
Hongchao Zhou, Xiaohong Guan, Chengjie Wu