Sciweavers

Share
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Revisiting T. Uno and M. Yagiura's Algorithm
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
9 years 7 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
ISAAC
2005
Springer
145views Algorithms» more  ISAAC 2005»
9 years 7 months ago
A Novel Adaptive Learning Algorithm for Stock Market Prediction
Lean Yu, Shouyang Wang, Kin Keung Lai
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
ISAAC
2005
Springer
116views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Multiple Polyline to Polygon Matching
Mirela Tanase, Remco C. Veltkamp, Herman J. Haverk...
ISAAC
2005
Springer
102views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Dense Subgraph Problems with Output-Density Conditions
Akiko Suzuki, Takeshi Tokuyama
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
9 years 7 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
books