Sciweavers

15073 search results - page 2753 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SAS
1999
Springer
15 years 8 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
108
Voted
KDD
1998
ACM
84views Data Mining» more  KDD 1998»
15 years 8 months ago
Similarity of Attributes by External Probes
In data mining, similarity or distance between attributes is one of the central notions. Such a notion can be used to build attribute hierarchies etc. Similarity metrics can be us...
Gautam Das, Heikki Mannila, Pirjo Ronkainen
SIGMETRICS
1997
ACM
117views Hardware» more  SIGMETRICS 1997»
15 years 8 months ago
Informed Multi-Process Prefetching and Caching
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
Andrew Tomkins, R. Hugo Patterson, Garth A. Gibson
AGENTS
1997
Springer
15 years 8 months ago
Adaptable Local Level Arbitration of Behaviors
During the last few years, and in an attempt to provide an ecient alternative to classical methods to designing robot control structures, the behavior-based approach has emerged....
Mohamed Salah Hamdi, Karl Kaiser
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 8 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
« Prev « First page 2753 / 3015 Last » Next »