Sciweavers

4761 search results - page 368 / 953
» Generalizing Boundary Points
Sort
View
DAC
2006
ACM
16 years 8 months ago
Rapid and low-cost context-switch through embedded processor customization for real-time and control applications
In this paper, we present a methodology for low-cost and rapid context switch for multithreaded embedded processors with realtime guarantees. Context-switch, which involves saving...
Xiangrong Zhou, Peter Petrov
SOUPS
2005
ACM
16 years 1 months ago
Authentication using graphical passwords: effects of tolerance and image choice
Graphical passwords are an alternative to alphanumeric passwords in which users click on images to authenticate themselves rather than type alphanumeric strings. We have developed...
Susan Wiedenbeck, Jim Waters, Jean-Camille Birget,...
LCTRTS
2005
Springer
16 years 29 days ago
Efficient application migration under compiler guidance
Mobile computing based upon wireless technology as the interconnect and PDAs, Web-enabled cell phones etc. as the end devices provide a rich infrastructure for anywhere, anytime i...
Kun Zhang, Santosh Pande
ICCD
1997
IEEE
94views Hardware» more  ICCD 1997»
15 years 11 months ago
Pseudo-Random Pattern Testing of Bridging Faults
: This paper studies pseudo-random pattern testing of bridging faults. Although bridging faults are generally more random pattern testable than stuck-at faults, examples are shown ...
Nur A. Touba, Edward J. McCluskey
COMPGEOM
2007
ACM
15 years 11 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann