Sciweavers

12272 search results - page 2107 / 2455
» Experimental program analysis
Sort
View
204
Voted
SIGIR
2010
ACM
15 years 5 months ago
Incorporating global information into named entity recognition systems using relational context
The state-of-the-art in Named Entity Recognition relies on a combination of local features of the text and global knowledge to determine the types of the recognized entities. This...
Yuval Merhav, Filipe de Sá Mesquita, Denils...
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TASLP
2010
118views more  TASLP 2010»
15 years 5 months ago
Time-Frequency Sparsity by Removing Perceptually Irrelevant Components Using a Simple Model of Simultaneous Masking
Abstract—We present an algorithm for removing timefrequency components, found by a standard Gabor transform, of a “real-world” sound while causing no audible difference to th...
Péter Balázs, Bernhard Laback, Gerha...
TELSYS
2010
94views more  TELSYS 2010»
15 years 5 months ago
An improved Hurst parameter estimator based on fractional Fourier transform
A fractional Fourier transform (FrFT) based estimation method is introduced in this paper to analyze the long range dependence (LRD) in time series. The degree of LRD can be chara...
Yangquan Chen, Rongtao Sun, Anhong Zhou
TPDS
2010
135views more  TPDS 2010»
15 years 5 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
« Prev « First page 2107 / 2455 Last » Next »