Search Sciweavers | Sciweavers

10988 search results - page 61 / 2198

» Algorithmic Folding Complexity

click to vote

EUROPAR
2000
Springer

105views Distributed And Parallel Com...» more EUROPAR 2000»

BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations

14 years 20 days ago

Download www.cs.cmu.edu

We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, ge...

Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Gol...

claim paper

Read More »

click to vote

ICONIP
2004

141views Information Technology» more ICONIP 2004»

Non-linear Dimensionality Reduction by Locally Linear Isomaps

13 years 10 months ago

Download ai.stanford.edu

Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...

Ashutosh Saxena, Abhinav Gupta, Amitabha Mukerjee

claim paper

Read More »

click to vote

JSAC
2006

157views more JSAC 2006»

Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms

13 years 9 months ago

Download www-sop.inria.fr

We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...

Shu Huang, Rudra Dutta, George N. Rouskas

claim paper

Read More »

click to vote

CIAC
2006
Springer

110views Algorithms» more CIAC 2006»

Distance Approximating Trees: Complexity and Algorithms

14 years 24 days ago

Download www.cs.kent.edu

Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )

Feodor F. Dragan, Chenyu Yan

claim paper