Sciweavers

1361 search results - page 120 / 273
» Spaces of practice
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 1 months ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset
POPL
2001
ACM
16 years 1 months ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe
OSDI
2008
ACM
16 years 1 months ago
An Internet Protocol Address Clustering Algorithm
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
Robert Beverly, Karen R. Sollins
ICCD
2007
IEEE
105views Hardware» more  ICCD 2007»
15 years 10 months ago
Exploring the interplay of yield, area, and performance in processor caches
The deployment of future deep submicron technology calls for a careful review of existing cache organizations and design practices in terms of yield and performance. This paper pr...
Hyunjin Lee, Sangyeun Cho, Bruce R. Childers
ICCAD
2005
IEEE
121views Hardware» more  ICCAD 2005»
15 years 10 months ago
Transition-by-transition FSM traversal for reachability analysis in bounded model checking
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
Minh D. Nguyen, Dominik Stoffel, Markus Wedler, Wo...