Sciweavers

162 search results - page 22 / 33
» Study of Lower Bound Functions for MAX-2-SAT
Sort
View
JCB
2008
144views more  JCB 2008»
14 years 11 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
ROBOCOMM
2007
IEEE
15 years 6 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
VLDB
2004
ACM
106views Database» more  VLDB 2004»
15 years 5 months ago
On The Marriage of Lp-norms and Edit Distance
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
Lei Chen 0002, Raymond T. Ng
PODC
2003
ACM
15 years 5 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
CORR
2006
Springer
107views Education» more  CORR 2006»
14 years 11 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus