Sciweavers

1042 search results - page 59 / 209
» Failing First: An Update
Sort
View
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
15 years 7 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...
147
Voted
JANCL
2008
109views more  JANCL 2008»
15 years 4 months ago
Conditionalization and total knowledge
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
Ian Pratt-Hartmann
WAW
2010
Springer
311views Algorithms» more  WAW 2010»
15 years 2 months ago
Game-Theoretic Models of Information Overload in Social Networks
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
Christian Borgs, Jennifer T. Chayes, Brian Karrer,...
ICML
2006
IEEE
16 years 5 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 10 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...