Sciweavers

10568 search results - page 1638 / 2114
» Computer Intelligence and Formalization
Sort
View
EOR
2006
130views more  EOR 2006»
15 years 7 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
GIS
2006
ACM
15 years 7 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
IJAHUC
2006
128views more  IJAHUC 2006»
15 years 7 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
COGSCI
2007
99views more  COGSCI 2007»
15 years 7 months ago
Language Evolution by Iterated Learning With Bayesian Agents
Languages are transmitted from person to person and generation to generation via a process of iterated learning: people learn a language from other people who once learned that la...
Thomas L. Griffiths, Michael L. Kalish
223
Voted
IS
2008
15 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
« Prev « First page 1638 / 2114 Last » Next »