Sciweavers

4536 search results - page 666 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
KDD
2009
ACM
206views Data Mining» more  KDD 2009»
16 years 7 months ago
Ranking-based clustering of heterogeneous information networks with star network schema
A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden s...
Yizhou Sun, Yintao Yu, Jiawei Han
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 6 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
192
Voted
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
16 years 6 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
BTW
2007
Springer
154views Database» more  BTW 2007»
16 years 24 days ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...