Sciweavers

113 search results - page 11 / 23
» When can a graph form an orthogonal polyhedron
Sort
View
ICMT
2011
Springer
12 years 10 months ago
Toward Bidirectionalization of ATL with GRoundTram
ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form ca...
Isao Sasano, Zhenjiang Hu, Soichiro Hidaka, Kazuhi...
LACL
2011
Springer
12 years 10 months ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 1 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
13 years 11 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 4 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel