Algorithms | Sciweavers

56

WALCOM
2007
IEEE

151views Algorithms» more WALCOM 2007»

Base Station Placement Problem on the Boundary of a Convex Region

14 years 23 days ago

Due to the recent growth in the demand of mobile communication services in several typical environments, the development of eﬃcient systems for providing specialized services ha...

Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...

claim paper

Read More »

35

click to vote

WALCOM
2007
IEEE

109views Algorithms» more WALCOM 2007»

Pattern Matching in Degenerate DNA/RNA Sequences

14 years 23 days ago

Download www.dcs.kcl.ac.uk

In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present ...

M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mou...

claim paper

Read More »

27

click to vote

WALCOM
2007
IEEE

73views Algorithms» more WALCOM 2007»

Minimum Face-Spanning Subgraphs of Plane Graphs

14 years 23 days ago

Download folk.uib.no

Md. Mostofa Ali Patwary, Md. Saidur Rahman

claim paper

Read More »

29

click to vote

WALCOM
2007
IEEE

82views Algorithms» more WALCOM 2007»

Methods for Searching Mutual Visible-Intervals on Moving Object

14 years 23 days ago

Download teacher.buet.ac.bd

Abstract. Computing visible information, such as a visible surface determination, is a signiﬁcant problem and has been mainly studied in the ﬁelds of computational geometry and...

Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...

claim paper

Read More »

30

click to vote

SODA
1992
ACM

95views Algorithms» more SODA 1992»

The Probabilistic Method

14 years 23 days ago

Download assets.cambridge.org

Joel Spencer

claim paper

Read More »

30

click to vote

SODA
1992
ACM

90views Algorithms» more SODA 1992»

Self-Testing Polynomial Functions Efficiently and Over Rational Domains

14 years 23 days ago

Download people.csail.mit.edu

In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...

Ronitt Rubinfeld, Madhu Sudan

claim paper

Read More »

27

click to vote

SODA
1992
ACM

72views Algorithms» more SODA 1992»

Tail Estimates for the Space Complexity of Randomized Incremental Algorithms

14 years 23 days ago

Download edocs.fu-berlin.de

Kurt Mehlhorn, Micha Sharir, Emo Welzl

claim paper

Read More »

35

click to vote

SODA
1992
ACM

140views Algorithms» more SODA 1992»

Separation and Approximation of Polyhedral Objects

14 years 23 days ago

Download www.ams.sunysb.edu

Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...

Joseph S. B. Mitchell, Subhash Suri

claim paper

Read More »

39

click to vote

SODA
1992
ACM

123views Algorithms» more SODA 1992»

Computing Minimal Spanning Subgraphs in Linear Time

14 years 23 days ago

Download www.cs.utexas.edu

Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...

Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...

claim paper

Read More »

37

click to vote

SODA
1992
ACM

96views Algorithms» more SODA 1992»

Lower Bounds for On-Line Graph Coloring

14 years 23 days ago