Sciweavers

2497 search results - page 206 / 500
» Requirements for models of achievable routing
Sort
View
ASM
2010
ASM
15 years 10 months ago
Starting B Specifications from Use Cases
The B method is one of the most used formal methods, when reactive systems is under question, due to good support for refinement. However, obtaining the formal model from requireme...
Thiago C. de Sousa, Aryldo G. Russo
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
16 years 7 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
QSHINE
2009
IEEE
16 years 1 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
RECONFIG
2009
IEEE
165views VLSI» more  RECONFIG 2009»
16 years 1 months ago
Composable and Persistent-State Application Swapping on FPGAs Using Hardwired Network on Chip
—We envision that future FPGA will use a hardwired network on chip (HWNoC) [14] as a unified interconnect for functional communications (data and control) as well as configurat...
Muhammad Aqeel Wahlah, Kees G. W. Goossens
CVPR
2010
IEEE
16 years 7 days ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang