Sciweavers

2107 search results - page 93 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
DM
2006
128views more  DM 2006»
15 years 3 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
142
Voted
ASPLOS
2006
ACM
15 years 9 months ago
Temporal search: detecting hidden malware timebombs with virtual machines
Worms, viruses, and other malware can be ticking bombs counting down to a specific time, when they might, for example, delete files or download new instructions from a public we...
Jedidiah R. Crandall, Gary Wassermann, Daniela A. ...
99
Voted
HAPTICS
2009
IEEE
15 years 10 months ago
Determining appropriate parameters to elicit linear and circular apparent motion using vibrotactile cues
This paper reports on two experiments we conducted to look at how to design effective linear and circular apparent-motion displays. Using a two-tactor array on the upper arm, the ...
Masataka Niwa, Robert W. Lindeman, Yuichi Itoh, Fu...
GLVLSI
2009
IEEE
172views VLSI» more  GLVLSI 2009»
15 years 7 months ago
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
Emre Salman, Renatas Jakushokas, Eby G. Friedman, ...
ALT
2004
Springer
16 years 9 days ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster