Sciweavers

2635 search results - page 102 / 527
» Algorithms for the Database Layout Problem
Sort
View
146
Voted
EVOW
2006
Springer
15 years 7 months ago
Mining Structural Databases: An Evolutionary Multi-Objetive Conceptual Clustering Methodology
Abstract. The increased availability of biological databases containing representations of complex objects permits access to vast amounts of data. In spite of the recent renewed in...
Rocío Romero-Záliz, Cristina Rubio-E...
151
Voted
ESANN
2000
15 years 5 months ago
Distributed clustering and local regression for knowledge discovery in multiple spatial databases
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Ob...
NAR
2006
120views more  NAR 2006»
15 years 4 months ago
SuperNatural: a searchable database of available natural compounds
Although tremendous effort has been put into synthetic libraries, most drugs on the market are still 10 natural compounds or derivatives thereof. There are encyclopaedias of natur...
Mathias Dunkel, Melanie Füllbeck, Stefanie Ne...
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 9 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
FUN
2007
Springer
120views Algorithms» more  FUN 2007»
15 years 8 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono