Sciweavers

2944 search results - page 499 / 589
» Improving Bound Propagation
Sort
View
GRID
2004
Springer
15 years 10 months ago
Grid-based Indexing of a Newswire Corpus
In this paper we report experience in the use of computational grids in the domain of natural language processing, particularly in the area of information extraction, to create qu...
Baden Hughes, Srikumar Venugopal, Rajkumar Buyya
MFCS
2004
Springer
15 years 10 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 10 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
SCOPES
2004
Springer
15 years 10 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
ARITH
2003
IEEE
15 years 10 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger