Sciweavers

1142 search results - page 193 / 229
» Approximability of Clausal Constraints
Sort
View
119
Voted
ICML
2010
IEEE
15 years 3 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
IANDC
2008
128views more  IANDC 2008»
15 years 2 months ago
Rule-based static analysis of network protocol implementations
Today's software systems communicate over the Internet using standard protocols that have been heavily scrutinized, providing some assurance of resistance to malicious attack...
Octavian Udrea, Cristian Lumezanu, Jeffrey S. Fost...
DT
2006
109views more  DT 2006»
15 years 2 months ago
Test Consideration for Nanometer-Scale CMOS Circuits
The ITRS (International Technology Roadmap for Semiconductors) predicts aggressive scaling down of device size, transistor threshold voltage and oxide thickness to meet growing de...
Kaushik Roy, T. M. Mak, Kwang-Ting (Tim) Cheng
IJRR
2008
95views more  IJRR 2008»
15 years 1 months ago
Legless Locomotion: A Novel Locomotion Technique for Legged Robots
We present a novel locomotion strategy called legless locomotion that allows a round-bodied legged robot to locomote approximately when it is high-centered. Typically, a high-cent...
Ravi Balasubramanian, Alfred A. Rizzi, Matthew T. ...
IVC
2008
138views more  IVC 2008»
15 years 1 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...