Sciweavers

680 search results - page 51 / 136
» Complexity of Strict Implication
Sort
View
AAAI
2008
13 years 10 months ago
A Theory of Expressiveness in Mechanisms
A key trend in (electronic) commerce is a demand for higher levels of expressiveness in the mechanisms that mediate interactions. We develop a theory that ties the expressiveness ...
Michael Benisch, Norman M. Sadeh, Tuomas Sandholm
AIS
2006
Springer
13 years 7 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
ICNS
2007
IEEE
14 years 2 months ago
DRR-SFF: A Practical Scheduling Algorithm to Improve the Performance of Short Flows
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
Changhua Sun, Lei Shi, Chengchen Hu, Bin Liu
WAIFI
2007
Springer
175views Mathematics» more  WAIFI 2007»
14 years 1 months ago
Attacking the Filter Generator over GF (2 m )
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
Sondre Rønjom, Tor Helleseth
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 7 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin