Sciweavers

3221 search results - page 424 / 645
» Termination of Linear Programs
Sort
View
ICML
2005
IEEE
16 years 7 months ago
The cross entropy method for classification
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
Shie Mannor, Dori Peleg, Reuven Y. Rubinstein
WWW
2006
ACM
16 years 7 months ago
A framework for XML data streams history checking and monitoring
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
Alessandro Campi, Paola Spoletini
VLSID
2007
IEEE
160views VLSI» more  VLSID 2007»
16 years 6 months ago
Spectral RTL Test Generation for Microprocessors
We introduce a novel method of test generation for microprocessors at the RTL using spectral methods. Test vectors are generated for RTL faults, which are the stuck-at faults on i...
Nitin Yogi, Vishwani D. Agrawal
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
16 years 6 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu
ICALP
2009
Springer
16 years 6 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin