350 search results - page 50 / 70 » Lower and upper bounds on obtaining history independence |
100
click to vote
ICFCA
2004
Springer
15 years 5 months ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
RTAS
2006
IEEE
15 years 5 months ago
2006
IEEE
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
113
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
CCGRID
2009
IEEE
15 years 6 months ago
2009
IEEE
Volunteer Computing (VC) projects harness the power of computers owned by volunteers across the Internet to perform hundreds of thousands of independent jobs. In VC projects, the ...