2542 search results - page 182 / 509 » Computing Cartograms with Optimal Complexity |
127
Voted
IPMI
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...
158
Voted
STOC
2007
ACM
16 years 1 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...
102
Voted
PEPM
2010
ACM
15 years 9 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
88
Voted
CPAIOR
2009
Springer
15 years 7 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
106
Voted
WCNC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...