Sciweavers

4850 search results - page 736 / 970
» Approximate Data Structures with Applications
Sort
View
178
Voted
EUROPAR
1998
Springer
15 years 9 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
VLDB
1989
ACM
114views Database» more  VLDB 1989»
15 years 9 months ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
145
Voted
EDBT
2000
ACM
15 years 8 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
LWA
2007
15 years 6 months ago
Know the Right People? Recommender Systems for Web 2.0
Web 2.0 applications like Flickr, YouTube, or Del.icio.us are increasingly popular online communities for creating, editing and sharing content. However, the rapid increase in siz...
Stefan Siersdorfer, Sergej Sizov, Paul Clough
PUC
2002
82views more  PUC 2002»
15 years 4 months ago
A Location Model for Communicating and Processing of Context
Location is one of the most important elements of context in ubiquitous computing. In this paper we describe a location model, a spatial-aware communication model and an implement...
Michael Beigl, Tobias Zimmer, Christian Decker