Sciweavers

2800 search results - page 183 / 560
» Scaling RDF with time
Sort
View
HPCS
2006
IEEE
16 years 20 days ago
Evaluation of Knapsack-Based Scheduling Using the NPACI JOBLOG
GridX1 is a computational grid deployment of off-theshelf components using shared resources at several Canadian research institutions. This work evaluates the applicability of kna...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Rafae...
ICDCSW
2002
IEEE
15 years 11 months ago
A Demand based Algorithm for Rapid Updating of Replicas
In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algo...
Jesús Acosta-Elías, Leandro Navarro-...
ICMLA
2008
15 years 8 months ago
Probabilistic Exploitation of the Lucas and Kanade Smoothness Constraint
The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constrai...
Volker Willert, Julian Eggert, Marc Toussaint, Edg...
NIPS
2001
15 years 8 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola
CORR
2007
Springer
67views Education» more  CORR 2007»
15 years 6 months ago
Novelty and Collective Attention
The subject of collective attention is central to an information age where millions of people are inundated with daily messages. It is thus of interest to understand how attention...
Fang Wu, Bernardo A. Huberman