Sciweavers

1012 search results - page 121 / 203
» Segment intersection searching problems in general settings
Sort
View
CAISE
2007
Springer
15 years 10 months ago
Automatic Generation of Model Translations
Abstract. The translation of information between heterogeneous representations is a long standing issue. With the large spreading of cooperative applications fostered by the advent...
Paolo Papotti, Riccardo Torlone
141
Voted
NETWORKS
2010
15 years 3 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
APPML
2007
154views more  APPML 2007»
15 years 4 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio
AI
2006
Springer
15 years 8 months ago
Classification Based on Logical Concept Analysis
This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a ...
Yan Zhao, Yiyu Yao
ASAP
2004
IEEE
171views Hardware» more  ASAP 2004»
15 years 8 months ago
CHARMED: A Multi-Objective Co-Synthesis Framework for Multi-Mode Embedded Systems
In this paper, we present a modular co-synthesis framework called CHARMED that solves the problem of hardware-software co-synthesis of periodic, multi-mode, distributed, embedded ...
Vida Kianzad, Shuvra S. Bhattacharyya