Sciweavers

2800 search results - page 258 / 560
» Scaling RDF with time
Sort
View
148
Voted
ATAL
2008
Springer
15 years 8 months ago
Towards bidirectional distributed matchmaking
Matchmaking is the process of introducing two or more agents to each other. Current matchmaking techniques are unidirectional and fail to address large-scale and highly dynamic sy...
Victor Shafran, Gal A. Kaminka, Sarit Kraus, Claud...
ISLPED
2007
ACM
123views Hardware» more  ISLPED 2007»
15 years 8 months ago
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
Sushu Zhang, Karam S. Chatha, Goran Konjevod
AAAI
2010
15 years 8 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
NIPS
2008
15 years 8 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
ECIS
2001
15 years 8 months ago
Modelling IS successions in e commerce
The paper considers the conditions governing the diffusion and development of e-commerce. The analysis builds on earlier discussions of technological successions and explores a nu...
Paul Windrum, Chris Birchenhall, Ray Hackney