1132 search results - page 193 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
105
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
129
Voted
ICDE
2010
IEEE
16 years 1 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...
DCC
2005
IEEE
16 years 1 months ago
2005
IEEE
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
ALT
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
102
click to vote
CCGRID
2009
IEEE
15 years 8 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 ...