Sciweavers

3134 search results - page 32 / 627
» Computing full disjunctions
Sort
View
ICDCN
2011
Springer
13 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
CP
2000
Springer
14 years 1 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CGF
2008
152views more  CGF 2008»
13 years 10 months ago
Capturing Intention-based Full-Frame Video Stabilization
Annoying shaky motion is one of the significant problems in home videos, since hand shake is an unavoidable effect when capturing by using a hand-held camcorder. Video stabilizati...
Bing-Yu Chen, Ken-Yi Lee, Wei-Ting Huang, Jong-Sha...
RTCSA
2007
IEEE
14 years 4 months ago
Virtual Full Replication by Adaptive Segmentation
We propose Virtual Full Replication by Adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication ...
Gunnar Mathiason, Sten F. Andler, Sang Hyuk Son
ICML
2006
IEEE
14 years 10 months ago
Full Bayesian network classifiers
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
Jiang Su, Harry Zhang