1941 search results - page 38 / 389 » On the Hardness of Approximate Reasoning |
ECRTS
1999
IEEE
15 years 4 months ago
1999
IEEE
In the eld of safety-critical real-time systems the development of distributed applications for fault tolerance reasons is a common practice. Hereby the whole application is divid...
100
click to vote
PVLDB
2010
14 years 10 months ago
2010
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
CHI
2010
ACM
14 years 9 months ago
2010
ACM
Mobile services can provide users with information relevant to their current circumstances. Distant services in turn can acquire local information from people in an area of intere...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
101
click to vote
PLDI
2006
ACM
15 years 5 months ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...