Sciweavers

3823 search results - page 530 / 765
» Experiments with Random Projection
Sort
View
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 8 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
WEBI
2004
Springer
15 years 8 months ago
Type-Based Composition of Information Services in Large Scale Environments
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
EH
2003
IEEE
100views Hardware» more  EH 2003»
15 years 8 months ago
Learning for Evolutionary Design
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
Sushil J. Louis
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 8 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
ICDM
2003
IEEE
240views Data Mining» more  ICDM 2003»
15 years 8 months ago
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
Eamonn J. Keogh, Jessica Lin, Wagner Truppel