Sciweavers

3146 search results - page 558 / 630
» Efficient Consequence Finding
Sort
View
SIGIR
2008
ACM
13 years 10 months ago
On profiling blogs with representative entries
With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a give...
Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 10 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
TCAD
2008
114views more  TCAD 2008»
13 years 10 months ago
Three-Dimensional Chip-Multiprocessor Run-Time Thermal Management
Three-dimensional integration has the potential to improve the communication latency and integration density of chip-level multiprocessors (CMPs). However, the stacked highpower de...
Changyun Zhu, Zhenyu (Peter) Gu, Li Shang, Robert ...
BIOINFORMATICS
2005
151views more  BIOINFORMATICS 2005»
13 years 10 months ago
Differential and trajectory methods for time course gene expression data
Motivation: The issue of high dimensionality in microarray data has been, and remains, a hot topic in statistical and computational analysis. Efficient gene filtering and differen...
Yulan Liang, Bamidele Tayo, Xueya Cai, Arpad Kelem...
JCM
2007
131views more  JCM 2007»
13 years 10 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze