903 search results - page 66 / 181 » Non-well-founded trees in categories |
176
click to vote
DOCENG
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we propose to extend XQuery - the XML query language - with a set of transformation operators which will produce a copy of an XML tree in which some subtrees will b...
163
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
154
click to vote
VISSYM
2004
15 years 7 months ago
2004
It is difficult for the average viewer to assimilate and comprehend huge amounts of high-dimensional data. It is important to present data in a way that allows the user a high lev...
178
click to vote
JACM
2007
15 years 6 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
186
click to vote
CLEF
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we describe an approach for the automatic medical image annotation task of the 2009 CLEF cross-language image retrieval campaign (ImageCLEF). This work is focused o...