Sciweavers

1458 search results - page 5 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
LPAR
2004
Springer
14 years 21 days ago
Weighted Answer Sets and Applications in Intelligence Analysis
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
COLT
2004
Springer
14 years 22 days ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
VLDB
2005
ACM
162views Database» more  VLDB 2005»
14 years 25 days ago
XQuery Implementation in a Relational Database System
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michae...
INFOVIS
2005
IEEE
14 years 28 days ago
Importance-Driven Visualization Layouts for Large Time Series Data
Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in p...
Ming C. Hao, Umeshwar Dayal, Daniel A. Keim, Tobia...
LREC
2008
129views Education» more  LREC 2008»
13 years 8 months ago
Spectral Clustering for a Large Data Set by Reducing the Similarity Matrix Size
Spectral clustering is a powerful clustering method for document data set. However, spectral clustering needs to solve an eigenvalue problem of the matrix converted from the simil...
Hiroyuki Shinnou, Minoru Sasaki