Sciweavers

2370 search results - page 159 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
BROADNETS
2005
IEEE
15 years 3 months ago
Uniform vs. non-uniform band switching in WDM networks
— We compare the effectiveness of uniform versus non-uniform waveband switching under the dual cost metrics of switching requirements and fiber capacity. We consider a star topo...
Li-Wei Chen, Poompat Saengudomlert, Eytan Modiano
ICDM
2005
IEEE
188views Data Mining» more  ICDM 2005»
15 years 3 months ago
CLUMP: A Scalable and Robust Framework for Structure Discovery
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
Kunal Punera, Joydeep Ghosh
89
Voted
ICMCS
2005
IEEE
114views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Self Configurable Queries for Digital Image Libraries
Since multimedia information is characterized by motley types of media with different properties, multimedia content retrieval in digital libraries requires dynamic reconfigurable...
Panagiotis Karagiannis, Nikolaos D. Doulamis, Geor...
ICANN
2005
Springer
15 years 3 months ago
Balancing Guidance Range and Strength Optimizes Self-organization by Silicon Growth Cones
Abstract. We characterize the first hardware implementation of a selforganizing map algorithm based on axon migration. A population of silicon growth cones automatically wires a t...
Brian Taba, Kwabena Boahen
PCI
2005
Springer
15 years 3 months ago
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
Stavros D. Nikolopoulos, Leonidas Palios