Sciweavers

4541 search results - page 19 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
JMLR
2012
11 years 11 months ago
Transductive Learning of Structural SVMs via Prior Knowledge Constraints
Reducing the number of labeled examples required to learn accurate prediction models is an important problem in structured output prediction. In this paper we propose a new transd...
Chun-Nam Yu
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
14 years 2 months ago
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
IDEAL
2003
Springer
14 years 1 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
EDBT
2009
ACM
222views Database» more  EDBT 2009»
14 years 3 months ago
Data clouds: summarizing keyword search results over structured data
Keyword searches are attractive because they facilitate users searching structured databases. On the other hand, tag clouds are popular for navigation and visualization purposes o...
Georgia Koutrika, Zahra Mohammadi Zadeh, Hector Ga...
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 9 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...