Sciweavers

1971 search results - page 270 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
86
Voted
PG
2007
IEEE
15 years 7 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
105
Voted
CIKM
2009
Springer
15 years 4 months ago
Classification-based resource selection
In some retrieval situations, a system must search across multiple collections. This task, referred to as federated search, occurs for example when searching a distributed index o...
Jaime Arguello, Jamie Callan, Fernando Diaz
102
Voted
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 1 months ago
Local decomposition for rare class analysis
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
Junjie Wu, Hui Xiong, Peng Wu, Jian Chen
SEMWEB
2009
Springer
15 years 7 months ago
Functions over RDF Language Elements
Spreadsheet tools are often used in business and private scenarios in order to collect and store data, and to explore and analyze these data by executing functions and aggregation...
Bernhard Schandl
WWW
2007
ACM
16 years 1 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook