Sciweavers

14699 search results - page 2539 / 2940
» Complexity and Cognitive Computing
Sort
View
CCR
2007
85views more  CCR 2007»
15 years 7 months ago
Don't optimize existing protocols, design optimizable protocols
As networks grow in size and complexity, network management has become an increasingly challenging task. Many protocols have tunable parameters, and optimization is the process of...
Jiayue He, Jennifer Rexford, Mung Chiang
IJPP
2008
72views more  IJPP 2008»
15 years 7 months ago
Modulo Path History for the Reduction of Pipeline Overheads in Path-based Neural Branch Predictors
Neural-inspired branch predictors achieve very low branch misprediction rates. However, previously proposed implementations have a variety of characteristics that make them challen...
Gabriel H. Loh, Daniel A. Jiménez
IPM
2008
133views more  IPM 2008»
15 years 7 months ago
DistanceRank: An intelligent ranking algorithm for web pages
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
Ali Mohammad Zareh Bidoki, Nasser Yazdani
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 7 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
IS
2008
15 years 7 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
« Prev « First page 2539 / 2940 Last » Next »