Sciweavers

7228 search results - page 759 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ALMOB
2006
155views more  ALMOB 2006»
15 years 7 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
INFOCOM
2011
IEEE
14 years 11 months ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...
CORR
2011
Springer
164views Education» more  CORR 2011»
14 years 11 months ago
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully e...
Dushyant Arora, Marcin Bienkowski, Anja Feldmann, ...
AAMAS
2008
Springer
15 years 7 months ago
DARE: a system for distributed abductive reasoning
Abductive reasoning is a well established field of Artificial Intelligence widely applied to different problem domains not least cognitive robotics and planning. It has been used ...
Jiefei Ma, Alessandra Russo, Krysia Broda, Keith C...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes