Sciweavers

2366 search results - page 50 / 474
» Mapping time
Sort
View
DATAMINE
2010
120views more  DATAMINE 2010»
13 years 8 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado
GLOBECOM
2008
IEEE
13 years 9 months ago
Automatic Large Scale Generation of Internet PoP Level Maps
—Point of presence (PoP) level Internet maps are promising for tasks such as reasoning about the Internet evolution in time or Internet delay estimation. We thus suggest an effi...
Dima Feldman, Yuval Shavitt
ISORC
2007
IEEE
14 years 3 months ago
Real-Time Dynamic Guarantee in Component-Based Middleware
This paper describes an extension to the componentbased programming model to support real-time dynamic guarantee for distributed applications. The extended model aims to include a...
Cássia Yuri Tatibana, Carlos Montez, R&ocir...
DATE
2007
IEEE
185views Hardware» more  DATE 2007»
14 years 3 months ago
An ILP formulation for system-level application mapping on network processor architectures
Current day network processors incorporate several architectural features including symmetric multi-processing (SMP), block multi-threading, and multiple memory elements to suppor...
Christopher Ostler, Karam S. Chatha
IPPS
2000
IEEE
14 years 1 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi