Sciweavers

4112 search results - page 52 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 5 months ago
A time efficient Delaunay refinement algorithm
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
Gary L. Miller
ACST
2006
15 years 5 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
139
Voted
AMC
2005
123views more  AMC 2005»
15 years 3 months ago
An efficient convergent lattice algorithm for European Asian options
Financial options whose payoff depends critically on historical prices are called pathdependent options. Their prices are usually harder to calculate than options whose prices do ...
Tian-Shyr Dai, Guan-Shieng Huang, Yuh-Dauh Lyuu
205
Voted
VLDB
2005
ACM
153views Database» more  VLDB 2005»
16 years 4 months ago
An effective and efficient algorithm for high-dimensional outlier detection
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...
Charu C. Aggarwal, Philip S. Yu
JPDC
2006
148views more  JPDC 2006»
15 years 3 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...