Sciweavers

2635 search results - page 313 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
2008
IEEE
140views Database» more  ICDE 2008»
16 years 8 months ago
Top-k Spatial Joins of Probabilistic Objects
Probabilistic data have recently become popular in applications such as scientific and geospatial databases. For images and other spatial datasets, probabilistic values can capture...
Vebjorn Ljosa, Ambuj K. Singh
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
16 years 1 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
IJDAR
2010
110views more  IJDAR 2010»
15 years 5 months ago
Locating and parsing bibliographic references in HTML medical articles
The set of references that typically appear toward the end of journal articles is sometimes, though not always, a field in bibliographic (citation) databases. But even if referenc...
Jie Zou, Daniel X. Le, George R. Thoma
ICDE
1995
IEEE
192views Database» more  ICDE 1995»
16 years 7 months ago
Mining Sequential Patterns
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
Rakesh Agrawal, Ramakrishnan Srikant
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han