Sciweavers

240 search results - page 11 / 48
» On Efficient Construction of Decision Trees from Large Datab...
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 4 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
CIKM
2009
Springer
13 years 11 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
CIKM
2010
Springer
13 years 5 months ago
Index structures for efficiently searching natural language text
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...
Pirooz Chubak, Davood Rafiei
ACL
2006
13 years 9 months ago
Morphological Richness Offsets Resource Demand - Experiences in Constructing a POS Tagger for Hindi
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
Smriti Singh, Kuhoo Gupta, Manish Shrivastava, Pus...