Sciweavers

969 search results - page 110 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
ICPP
2005
IEEE
14 years 2 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann
DGCI
2006
Springer
14 years 14 days ago
Revisiting Digital Straight Segment Recognition
Abstract. This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognitio...
François de Vieilleville, Jacques-Olivier L...
ECCV
2010
Springer
14 years 2 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
PAM
2009
Springer
14 years 3 months ago
Inferring POP-Level ISP Topology through End-to-End Delay Measurement
In this paper, we propose a new topology inference technique that aims to reveals how ISPs deploy their layer two and three networks at the POP level, without relying on ISP core n...
Kaoru Yoshida, Yutaka Kikuchi, Masateru Yamamoto, ...
CF
2004
ACM
14 years 2 months ago
The happy marriage of architecture and application in next-generation reconfigurable systems
New applications and standards are first conceived only for functional correctness and without concerns for the target architecture. The next challenge is to map them onto an arch...
Ingrid Verbauwhede, Patrick Schaumont