Sciweavers

3396 search results - page 441 / 680
» Tree representations of graphs
Sort
View
ECAI
1990
Springer
15 years 10 months ago
The Semantics of MOLUSC
Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...
Lynne J. Cahill, Gerald Gazdar
CIKM
2008
Springer
15 years 8 months ago
Rewriting of visibly pushdown languages for xml data integration
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
Alex Thomo, Srinivasan Venkatesh
JAIR
2010
145views more  JAIR 2010»
15 years 5 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
ATAL
2011
Springer
14 years 6 months ago
Multi-criteria argument selection in persuasion dialogues
The main goal of a persuasion dialogue is to persuade, but agents may have a number of additional goals concerning the dialogue duration, how much and what information is shared o...
Thomas L. van der Weide, Frank Dignum, John-Jules ...
WACV
2012
IEEE
14 years 2 months ago
CompactKdt: Compact signatures for accurate large scale object recognition
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...
Mohamed Aly, Mario E. Munich, Pietro Perona