Sciweavers

5595 search results - page 397 / 1119
» Comparing Subsumption Optimizations
Sort
View
NIPS
2004
15 years 8 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
IJES
2008
128views more  IJES 2008»
15 years 6 months ago
On-chip implementation of multiprocessor networks and switch fabrics
: On-chipimplementationofmultiprocessorsystemsneedstoplanarisetheinterconnect networks onto the silicon floorplan. Compared with traditional ASIC/SoC architectures, Multiprocessor ...
Terry Tao Ye, Giovanni De Micheli
TPDS
2008
93views more  TPDS 2008»
15 years 6 months ago
Evaluating Dynamic Task Mapping in Network Processor Runtime Systems
Modern network processor systems require the ability to adapt their processing capabilities at runtime to changes in network traffic. Traditionally, network processor applications ...
Xin Huang, Tilman Wolf
CCR
1999
93views more  CCR 1999»
15 years 6 months ago
A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic
In ATM UBR networks supporting TCP traffic, optimal efficiency can only be envisaged if switches adopt a discard mechanism that operates at the packet level rather than the cell l...
Vincent Rosolen, Olivier Bonaventure, Guy Leduc
ACL
2010
15 years 4 months ago
SystemT: An Algebraic Approach to Declarative Information Extraction
As information extraction (IE) becomes more central to enterprise applications, rule-based IE engines have become increasingly important. In this paper, we describe SystemT, a rul...
Laura Chiticariu, Rajasekar Krishnamurthy, Yunyao ...