Sciweavers

686 search results - page 14 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
ESTIMEDIA
2005
Springer
15 years 5 months ago
Custom Processor Design Using NISC: A Case-Study on DCT algorithm
Designing Application-Specific Instruction-set Processors (ASIPs) usually requires designing a custom datapath, and modifying instruction-set, instruction decoder, and compiler. A...
Bita Gorjiara, Daniel D. Gajski
ICML
2005
IEEE
16 years 15 days ago
A comparison of tight generalization error bounds
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
John Langford, Matti Kääriäinen
CVPR
2006
IEEE
16 years 1 months ago
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, ...
SSIAI
2000
IEEE
15 years 4 months ago
Pairwise Markov Random Fields and its Application in Textured Images Segmentation
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...
Wojciech Pieczynski, Abdel-Nasser Tebbache
CORR
2008
Springer
139views Education» more  CORR 2008»
14 years 11 months ago
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
Sunil Srinivasa, Martin Haenggi