1480 search results - page 196 / 296 » Distributed algorithms for weighted problems in sparse graph... |
165
click to vote
ICDAR
2009
IEEE
15 years 27 days ago
2009
IEEE
Chemical expressions have more variant structures in 2-D space than that in math equations. In this paper we propose a unified framework for recognizing handwritten chemical expre...
177
click to vote
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
127
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
105
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
119
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...