Sciweavers

520 search results - page 48 / 104
» Computing recombination networks from binary sequences
Sort
View
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
15 years 1 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
SIGMETRICS
1996
ACM
174views Hardware» more  SIGMETRICS 1996»
15 years 1 months ago
Embra: Fast and Flexible Machine Simulation
This paper describes Embra, a simulator for the processors, caches, and memory systems of uniprocessors and cache-coherent multiprocessors. When running as part of the SimOS simul...
Emmett Witchel, Mendel Rosenblum
TIME
1994
IEEE
15 years 1 months ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
ACCV
2006
Springer
15 years 3 months ago
Tracking Targets Via Particle Based Belief Propagation
We first formulate multiple targets tracking problem in a dynamic Markov network(DMN)which is derived from a MRFs for joint target state and a binary process for occlusion of dual...
Jianru Xue, Nanning Zheng, Xiaopin Zhong
BMCBI
2008
220views more  BMCBI 2008»
14 years 10 months ago
Gene prediction in metagenomic fragments: A large scale machine learning approach
Background: Metagenomics is an approach to the characterization of microbial genomes via the direct isolation of genomic sequences from the environment without prior cultivation. ...
Katharina J. Hoff, Maike Tech, Thomas Lingner, Rol...