Sciweavers

88 search results - page 12 / 18
» Performance Analysis of a Family of WHT Algorithms
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 7 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
BMCBI
2006
166views more  BMCBI 2006»
13 years 7 months ago
SEQOPTICS: a protein sequence clustering system
Background: Protein sequence clustering has been widely used as a part of the analysis of protein structure and function. In most cases single linkage or graph-based clustering al...
Yonghui Chen, Kevin D. Reilly, Alan P. Sprague, Zh...
FCCM
2006
IEEE
101views VLSI» more  FCCM 2006»
14 years 1 months ago
A Type Architecture for Hybrid Micro-Parallel Computers
Recently, platform FPGAs that integrate sequential processors with a spatial fabric have become prevalent. While these hybrid architectures ease the burden of integrating sequenti...
Benjamin Ylvisaker, Brian Van Essen, Carl Ebeling
TREC
2001
13 years 8 months ago
Link-based Approaches for Text Retrieval
We assess a family of ranking mechanisms for search engines based on linkage analysis using a carefully engineered subset of the World Wide Web, WT10g (Bailey, Craswell and Hawking...
Julien Gevrey, Stefan M. Rüger
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...