Sciweavers

729 search results - page 10 / 146
» Making news understandable to computers
Sort
View
NIPS
2007
13 years 11 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
AIS
2006
Springer
13 years 10 months ago
Togetherness and respect: ethical concerns of privacy in Global Web Societies
Today's computer network technologies are sociologically founded on hunter-gatherer principles; common users may be possible subjects of surveillance and sophisticated Interne...
Gordana Dodig-Crnkovic, Virginia Horniak
CHI
2001
ACM
14 years 10 months ago
What makes Web sites credible?: a report on a large quantitative study
The credibility of web sites is becoming an increasingly important area to understand. To expand knowledge in this domain, we conducted an online study that investigated how diffe...
B. J. Fogg, Jonathan Marshall, Othman Laraki, Alex...
ICPADS
1998
IEEE
14 years 2 months ago
One-Phase Commit: Does it make Sense?
1 Although widely used in distributed transactional systems, the so-called Two-Phase Commit (2PC) protocol introduces a substantial delay in transaction processing, even in the abs...
Maha Abdallah, Rachid Guerraoui, Philippe Pucheral
CIE
2006
Springer
14 years 1 months ago
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
Paulo Oliva