Sciweavers

848 search results - page 113 / 170
» Randomness and the linear degrees of computability
Sort
View
DAC
2010
ACM
15 years 1 days ago
Post-silicon diagnosis of segments of failing speedpaths due to manufacturing variations
We study diagnosis of segments on speedpaths that fail the timing constraint at the post-silicon stage due to manufacturing variations. We propose a formal procedure that is appli...
Lin Xie, Azadeh Davoodi, Kewal K. Saluja
CISS
2008
IEEE
15 years 4 hour ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
EOR
2008
52views more  EOR 2008»
14 years 12 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
COMGEO
2004
ACM
14 years 11 months ago
Proximity drawings in polynomial area and volume
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
Paolo Penna, Paola Vocca
TSP
2010
14 years 6 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón