Sciweavers

1584 search results - page 116 / 317
» Making priors a priority
Sort
View
FOCS
2008
IEEE
16 years 1 days ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ICDCS
2008
IEEE
16 years 20 hour ago
Accessibility-Based Resource Selection in Loosely-Coupled Distributed Systems
Large-scale distributed systems provide an attractive scalable infrastructure for network applications. However, the loosely-coupled nature of this environment can make data acces...
Jinoh Kim, Abhishek Chandra, Jon B. Weissman
ICDCS
2008
IEEE
16 years 20 hour ago
MR-PDP: Multiple-Replica Provable Data Possession
Many storage systems rely on replication to increase the availability and durability of data on untrusted storage systems. At present, such storage systems provide no strong evide...
Reza Curtmola, Osama Khan, Randal C. Burns, Giusep...
ICPR
2008
IEEE
16 years 13 hour ago
Finding the splitting vector for image resolution up-conversion
This paper proposes a new single-frame image upconversion approach that uses prior information. The proposed method overcomes the drawbacks of the Kondo 2001 where the class membe...
Xinyu Xu, Hao Pan
BIBE
2007
IEEE
147views Bioinformatics» more  BIBE 2007»
15 years 12 months ago
A New Alignment-Independent Algorithm for Clustering Protein Sequences
—The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important, the challenge is to identify subfamilies of evolut...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski