Sciweavers

1242 search results - page 209 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
CHI
2007
ACM
14 years 7 months ago
Software or wetware?: discovering when and why people use digital prosthetic memory
Our lives are full of memorable and important moments, as well as important items of information. The last few years have seen the proliferation of digital devices intended to sup...
Steve Whittaker, Vaiva Kalnikaité
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 7 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ATAL
2009
Springer
14 years 2 months ago
Combinatorial prediction markets for event hierarchies
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
Mingyu Guo, David M. Pennock
PODC
2005
ACM
14 years 29 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer