4926 search results - page 319 / 986 » Two Graph Algorithms On an Associative Computing Model |
167
click to vote
ALMOB
2006
15 years 5 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
165
Voted
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
149
click to vote
APCSAC
2005
IEEE
15 years 10 months ago
2005
IEEE
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate th...
163
click to vote
IWCMC
2010
ACM
15 years 7 months ago
2010
ACM
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
261
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...