3608 search results - page 721 / 722 » computing 2011 |
178
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
182
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
167
Voted
ACL
2011
14 years 10 months ago
2011
e evlute severl populr models of lol disourse oherene for domin nd tsk genE erlity y pplying them to ht disentngleE mentF
sing experiments ...
181
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
239
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...