Sciweavers

FUN
2007
Springer
120views Algorithms» more  FUN 2007»
15 years 8 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 8 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
DEXAW
2009
IEEE
89views Database» more  DEXAW 2009»
15 years 8 months ago
Collaborative Reputation-based Voice Spam Filtering
We propose a collaborative reputation-based voice spam filtering framework. Our approach uses the cumulative online duration of a VoIP user to derive his reputation value. And we l...
Ruishan Zhang, Andrei Gurtov
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
15 years 8 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...
FUN
2007
Springer
82views Algorithms» more  FUN 2007»
15 years 8 months ago
The Worst Page-Replacement Policy
In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of mi...
Kunal Agrawal, Michael A. Bender, Jeremy T. Finema...