Sciweavers

1170 search results - page 9 / 234
» How Fast Is Too Fast
Sort
View
EPIA
1993
Springer
14 years 3 months ago
Fast Methods for Solving Linear Diophantine Equations
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of...
Miguel Filgueiras, Ana Paula Tomás
JPDC
2006
134views more  JPDC 2006»
13 years 10 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 11 months ago
High-SNR Analysis of Outage-Limited Communications with Bursty and Delay-Limited Information
Abstract-- This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during...
Somsak Kittipiyakul, Petros Elia, Tara Javidi
ICASSP
2009
IEEE
14 years 5 months ago
Spoken term detection using fast phonetic decoding
While spoken term detection (STD) systems based on word indices provide good accuracy, there are several practical applications where it is infeasible or too costly to employ an L...
Roy Wallace, Robbie Vogt, Sridha Sridharan
RECOMB
2003
Springer
14 years 11 months ago
Approximation of protein structure for fast similarity measures
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
Fabian Schwarzer, Itay Lotan