Sciweavers

290 search results - page 34 / 58
» On the relationship between squared pairings and plain pairi...
Sort
View
LATIN
2004
Springer
14 years 1 months ago
Combinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Alantha Newman, Matthias Ruhl
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
13 years 12 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
CORR
2008
Springer
145views Education» more  CORR 2008»
13 years 7 months ago
The Capacity Region of Large Wireless Networks
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
Urs Niesen, Piyush Gupta, Devavrat Shah
IJSNET
2006
170views more  IJSNET 2006»
13 years 7 months ago
Ordinal MDS-based localisation for wireless sensor networks
: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been dif...
Vijayanth Vivekanandan, Vincent W. S. Wong
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 9 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...