Sciweavers

1450 search results - page 208 / 290
» On the Complexity of Hardness Amplification
Sort
View
IJCV
2010
194views more  IJCV 2010»
13 years 8 months ago
Extended Phase Field Higher-Order Active Contour Models for Networks - Its Application to Road Network Extraction from VHR Satel
This paper addresses the segmentation from an image of entities that have the form of a ‘network’, i.e. the region in the image corresponding to the entity is composed of bran...
Ting Peng, Ian H. Jermyn, Véronique Prinet,...
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
13 years 7 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
IMC
2010
ACM
13 years 7 months ago
Revisiting the case for a minimalist approach for network flow monitoring
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
Vyas Sekar, Michael K. Reiter, Hui Zhang
MEMOCODE
2010
IEEE
13 years 7 months ago
Proving transaction and system-level properties of untimed SystemC TLM designs
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
Daniel Große, Hoang M. Le, Rolf Drechsler
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely