Sciweavers

1068 search results - page 165 / 214
» On Space Bounded Server Algorithms
Sort
View
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 11 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 1 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
MM
2006
ACM
143views Multimedia» more  MM 2006»
14 years 2 months ago
Motion swarms: video interaction for art in complex environments
We create interactive art that can be enjoyed by groups such as audiences at public events with the intent to encourage communication with those around us as we play with the art....
Quoc Nguyen, Scott Novakowski, Jeffrey E. Boyd, Ch...
CIKM
2008
Springer
13 years 10 months ago
Creating tag hierarchies for effective navigation in social media
In social media, such as blogs, since the content naturally evolves over time, it is hard or in many cases impossible to organize the content for effective navigation. Thus, one c...
K. Selçuk Candan, Luigi Di Caro, Maria Luis...
GIS
2005
ACM
14 years 9 months ago
In-network surface simplification for sensor fields
Recent research literature on sensor network databases has focused on finding ways to perform in-network aggregation of sensor readings to reduce the message cost. However, with t...
Brian Harrington, Yan Huang