Sciweavers

5183 search results - page 870 / 1037
» The Complexity of Distributions
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 11 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 11 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
GIS
2009
ACM
15 years 11 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider
AGENTS
2001
Springer
15 years 11 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
DEXA
2000
Springer
132views Database» more  DEXA 2000»
15 years 10 months ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...