Sciweavers

7839 search results - page 1204 / 1568
» What's there and what's not
Sort
View
TIT
1998
90views more  TIT 1998»
15 years 1 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...
SIGIR
2002
ACM
15 years 1 months ago
Detecting and Browsing Events in Unstructured text
Previews and overviews of large, heterogeneous information resources help users comprehend the scope of collections and focus on particular subsets of interest. For narrative docu...
David A. Smith
TIT
1998
69views more  TIT 1998»
15 years 1 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
TKDE
1998
163views more  TKDE 1998»
15 years 1 months ago
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
—We investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called partition...
Jonathan E. Cook, Alexander L. Wolf, Benjamin G. Z...
TSE
1998
77views more  TSE 1998»
15 years 1 months ago
Use Case Maps as Architectural Entities for Complex Systems
ABSTRACT. This paper presents a novel, scenario-based notation called Use Case Maps (UCMs) for describing, in a high-level way, how the organizational structure of a complex system...
Raymond J. A. Buhr
« Prev « First page 1204 / 1568 Last » Next »