Search Sciweavers | Sciweavers

4315 search results - page 75 / 863

» Sorting in linear time

click to vote

WG
2005
Springer

96views Theoretical Computer Science» more WG 2005»

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs

14 years 1 months ago

Download www.jaist.ac.jp

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara

claim paper

Read More »

click to vote

ICCSA
2004
Springer

87views Applied Computing» more ICCSA 2004»

Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices

14 years 1 months ago

Download www.dcc.fc.up.pt

We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate...

Ana Paula Tomás, António Leslie Baju...

claim paper

Read More »

click to vote

ICTAC
2004
Springer

87views Applied Computing» more ICTAC 2004»

Verifying Linear Duration Constraints of Timed Automata

14 years 1 months ago

Download www.iist.unu.edu

Pham Hong Thai, Dang Van Hung

claim paper

Read More »

click to vote

COMPGEOM
2003
ACM

141views Discrete Geometry» more COMPGEOM 2003»

High-dimensional shape fitting in linear time

14 years 29 days ago

Download valis.cs.uiuc.edu

Let P be a set of n points in Rd. The radius of a k-dimensional ﬂat F with respect to P, denoted by RD(F, P), is deﬁned to be maxp∈P dist(F, p), where dist(F, p) denotes the...

Sariel Har-Peled, Kasturi R. Varadarajan

claim paper

Read More »

click to vote

CPM
2010
Springer

130views Combinatorics» more CPM 2010»

Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality

14 years 15 days ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers