Sciweavers

316 search results - page 27 / 64
» On the Space Complexity of Randomized Synchronization
Sort
View
ICPP
2006
IEEE
15 years 4 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
IPSN
2011
Springer
14 years 1 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
FGR
2011
IEEE
288views Biometrics» more  FGR 2011»
14 years 1 months ago
Hierarchical CRF with product label spaces for parts-based models
— Non-rigid object detection is a challenging open research problem in computer vision. It is a critical part in many applications such as image search, surveillance, humancomput...
Gemma Roig, Xavier Boix Bosch, Fernando De la Torr...
ADHOCNETS
2009
Springer
14 years 7 months ago
Compressing MAC Headers on Shared Wireless Media
This paper presents a header compression algorithm that unlike previous protocols is capable of compressing MAC headers in a multiple-access (shared) channel. Previous schemes coul...
Jesus Arango, Matthew Faulkner, Stephen Pink
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj