Sciweavers

2383 search results - page 66 / 477
» Finding Representative Set from Massive Data
Sort
View
ICDE
2006
IEEE
161views Database» more  ICDE 2006»
15 years 4 months ago
A Survey on Disk Oriented Querying and Reasoning on the Semantic Web
This paper presents a description of seven systems, which use database technology to both represent knowledge persistently and make scalable queries on it, in the Semantic Web con...
María del Mar Roldán García, ...
TKDE
2012
192views Formal Methods» more  TKDE 2012»
13 years 10 days ago
Discriminative Feature Selection by Nonparametric Bayes Error Minimization
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
Shuang-Hong Yang, Bao-Gang Hu
LREC
2010
178views Education» more  LREC 2010»
14 years 11 months ago
Like Finding a Needle in a Haystack: Annotating the American National Corpus for Idiomatic Expressions
This paper presents the details of a pilot study in which we tagged portions of the American National Corpus (ANC) for idioms composed of verb-noun constructions, prepositional ph...
Laura Street, Nathan Michalov, Rachel Silverstein,...
TC
2008
14 years 9 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
WWW
2007
ACM
15 years 10 months ago
Finding community structure in mega-scale social networks: [extended abstract]
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
Ken Wakita, Toshiyuki Tsurumi