Sciweavers

874 search results - page 124 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
ISCA
2006
IEEE
121views Hardware» more  ISCA 2006»
15 years 3 months ago
Flexible Snooping: Adaptive Forwarding and Filtering of Snoops in Embedded-Ring Multiprocessors
A simple and low-cost approach to supporting snoopy cache coherence is to logically embed a unidirectional ring in the network of a multiprocessor, and use it to transfer snoop me...
Karin Strauss, Xiaowei Shen, Josep Torrellas
ANSS
1998
IEEE
15 years 2 months ago
An Adaptive Synchronization Protocol for Parallel Discrete Event Simulation
Simulation, especially discrete event simulation (DES), is used in a variety of disciplines where numerical methods are difficult or impossible to apply. One problem with this met...
Keith R. Bisset
BMCBI
2010
86views more  BMCBI 2010»
14 years 10 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
CIKM
2007
Springer
15 years 4 months ago
Parallel linkage
We study the parallelization of the (record) linkage problem – i.e., to identify matching records between two collections of records, A and B. One of main idiosyncrasies of the ...
Hung-sik Kim, Dongwon Lee
MST
2007
154views more  MST 2007»
14 years 9 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...