Sciweavers

2104 search results - page 15 / 421
» Sorting with networks of data structures
Sort
View
IJON
2002
67views more  IJON 2002»
13 years 7 months ago
Test of spike-sorting algorithms on the basis of simulated network data
: Results of spike sorting algorithms are usually compared against recorded signals which themselves underly interpretations, distortions and errors. Our approach is to provide and...
Kerstin M. L. Menne, Andre Folkers, Thomas Malina,...
CVIU
2008
113views more  CVIU 2008»
13 years 7 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 7 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
KES
2007
Springer
14 years 1 months ago
Spreadsheet Interface Which Simplifies the Visualization of the Network Structures
We developed a system that extracts and visualizes the network structures from relational data on spreadsheets. Visualization through network diagrams obtained from relational data...
Satoshi Koike, Kazuo Misue, Jiro Tanaka
VLDB
1995
ACM
116views Database» more  VLDB 1995»
13 years 11 months ago
W3QS: A Query System for the World-Wide Web
The World-Wide Web (WWW) is an ever growing, distributed, non-administered, global information resource. It resides on the worldwide computer network and allows access to heteroge...
David Konopnicki, Oded Shmueli