Sciweavers

3394 search results - page 614 / 679
» Design patterns for semaphores
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 28 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
AIME
1997
Springer
14 years 26 days ago
A Task-Specific Ontology for the Application and Critiquing of Time-Oriented Clinical Guidelines
: Clinical guidelines reuse existing clinical procedural knowledge while leaving room for flexibility by the care provider applying that knowledge. Guidelines can be viewed as gene...
Yuval Shahar, Silvia Miksch, Peter Johnson
CF
2007
ACM
14 years 21 days ago
An analysis of the effects of miss clustering on the cost of a cache miss
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...
ICDCS
2010
IEEE
14 years 18 days ago
Extracting More Capacity from Multi-channel Multi-radio Wireless Networks by Exploiting Power
—Transmission power plays a crucial role in the design and performance of wireless networks. The issue is therefore complex since an increase in transmission power implies that a...
Devu Manikantan Shila, Yu Cheng, Tricha Anjali, Pe...
SIGIR
2010
ACM
14 years 18 days ago
Uncovering social spammers: social honeypots + machine learning
Web-based social systems enable new community-based opportunities for participants to engage, share, and interact. This community value and related services like search and advert...
Kyumin Lee, James Caverlee, Steve Webb