Sciweavers

1964 search results - page 282 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 7 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
106
Voted
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 2 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
PR
2007
146views more  PR 2007»
15 years 2 months ago
ML-KNN: A lazy learning approach to multi-label learning
Abstract: Multi-label learning originated from the investigation of text categorization problem, where each document may belong to several predefined topics simultaneously. In mul...
Min-Ling Zhang, Zhi-Hua Zhou
ICML
2008
IEEE
16 years 3 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
117
Voted
CGF
1998
110views more  CGF 1998»
15 years 2 months ago
Adaptive Supersampling in Object Space Using Pyramidal Rays
We introduce a new approach to three important problems in ray tracing: antialiasing, distributed light sources, and fuzzy reflections of lights and other surfaces. For antialias...
Jon D. Genetti, Dan Gordon, G. Williams