Sciweavers

4325 search results - page 737 / 865
» Incremental computation with names
Sort
View
DMGT
2011
94views more  DMGT 2011»
14 years 2 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 2 months ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
NAR
2011
202views Computer Vision» more  NAR 2011»
14 years 2 months ago
PREX: PeroxiRedoxin classification indEX, a database of subfamily assignments across the diverse peroxiredoxin family
PREX (http://www.csb.wfu.edu/prex/) is a database of currently 3516 peroxiredoxin (Prx or PRDX) protein sequences unambiguously classified into one of six distinct subfamilies. Pe...
Laura Soito, Chris Williamson, Stacy T. Knutson, J...
AAAI
2011
13 years 11 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
CSFW
2012
IEEE
13 years 1 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...