Sciweavers

7602 search results - page 1424 / 1521
» A New Approach to Base Revision
Sort
View
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 6 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
SIGMETRICS
2002
ACM
105views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
Mark S. Squillante, Yanyong Zhang, Anand Sivasubra...
PPOPP
2010
ACM
15 years 4 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
RAID
2010
Springer
15 years 4 months ago
Kernel Malware Analysis with Un-tampered and Temporal Views of Dynamic Kernel Memory
Dynamic kernel memory has been a popular target of recent kernel malware due to the difficulty of determining the status of volatile dynamic kernel objects. Some existing approach...
Junghwan Rhee, Ryan Riley, Dongyan Xu, Xuxian Jian...
SCN
2010
Springer
122views Communications» more  SCN 2010»
15 years 4 months ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo
« Prev « First page 1424 / 1521 Last » Next »