2095 search results - page 262 / 419 » Improved pebbling bounds |
191
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
161
click to vote
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
—We discuss a novel pilot design for multi-user channel estimation in the OFDM uplink with localized block-type pilot placement. Due to this placement, multiple users’ channels...
185
click to vote
WINET
2010
15 years 5 months ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
193
click to vote
NAACL
2010
15 years 4 months ago
2010
Typical statistical machine translation systems are trained with static parallel corpora. Here we account for scenarios with a continuous incoming stream of parallel training data...
188
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...