2432 search results - page 408 / 487 » Using simple abstraction to reinvent computing for paralleli... |
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
116
click to vote
NSPW
1998
ACM
15 years 1 months ago
1998
ACM
Object-based programming is becoming more and more popular and is currently conquering the world of distributed programming models. In object-based systems access control is often...
OPODIS
2010
14 years 7 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
Abstract— With the increasing cost of global communication onchip, high-performance designs for data-intensive applications require architectures that distribute hardware resourc...