Sciweavers

1382 search results - page 175 / 277
» Formal Analysis of Online Algorithms
Sort
View
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
JCB
2008
170views more  JCB 2008»
15 years 6 months ago
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...
Xu Ling, Xin He, Dong Xin, Jiawei Han
BMCBI
2006
155views more  BMCBI 2006»
15 years 6 months ago
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
Martin Petrek, Michal Otyepka, Pavel Banás,...
IPPS
2009
IEEE
16 years 1 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
FORMATS
2007
Springer
15 years 10 months ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson