Sciweavers

1736 search results - page 180 / 348
» The rank-width of Directed Graphs
Sort
View
ISCAS
1999
IEEE
95views Hardware» more  ISCAS 1999»
15 years 10 months ago
Evaluating iterative improvement heuristics for bigraph crossing minimization
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...
DAGSTUHL
2006
15 years 8 months ago
Rule-based Model Extraction from Source Code
Abstract. In the context of an approach for reengineering legacy software systems at the architectural level, we present in this paper a reverse engineering methodology that uses a...
Rui Correia, Carlos M. P. Matos, Mohammad El-Ramly...
IJSI
2008
126views more  IJSI 2008»
15 years 6 months ago
Modelling Route Instructions for Robust Human-Robot Interaction on Navigation Tasks
In this paper, we demonstrate the use of qualitative spatial modelling as the foundation for the conceptual representation of route instructions, to enable robust humanrobot intera...
Hui Shi, Bernd Krieg-Brückner
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
16 years 7 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...