Sciweavers

168 search results - page 32 / 34
» Abstract Interpretation for Worst and Average Case Analysis
Sort
View
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
14 years 16 days ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
INFOCOM
2003
IEEE
14 years 8 days ago
Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
Predrag R. Jelenkovic, Ana Radovanovic
INFOCOM
1999
IEEE
13 years 11 months ago
Multicast-Based Inference of Network-Internal Characteristics: Accuracy of Packet Loss Estimation
Abstract--We explore the use of end-to-end multicast traffic as measurement probes to infer network-internal characteristics. We have developed in an earlier paper [2] a Maximum Li...
Ramón Cáceres, Nick G. Duffield, Jos...
VLC
2010
91views more  VLC 2010»
13 years 5 months ago
A model-based recognition engine for sketched diagrams
Many of today’s recognition approaches for hand-drawn sketches are feature-based, which is conceptually similar to the recognition of hand-written text. While very suitable for ...
Florian Brieler, Mark Minas
ISJ
2008
93views more  ISJ 2008»
13 years 7 months ago
Knowledge transfer in globally distributed teams: the role of transactive memory
Abstract. This paper explores the role of transactive memory in enabling knowledge transfer between globally distributed teams. While the information systems literature has recentl...
Ilan Oshri, Paul C. van Fenema, Julia Kotlarsky