Sciweavers

409 search results - page 70 / 82
» Natures and Perspectives
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 9 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
MOBIHOC
2003
ACM
15 years 9 months ago
ESRT: event-to-sink reliable transport in wireless sensor networks
Wireless sensor networks (WSN) are event based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective...
Yogesh Sankarasubramaniam, Özgür B. Akan...
SOFSEM
2010
Springer
15 years 6 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
CHI
2010
ACM
15 years 4 months ago
Signed networks in social media
Relations between users on social media sites often reflect a mixture of positive (friendly) and negative (antagonistic) interactions. In contrast to the bulk of research on soci...
Jure Leskovec, Daniel P. Huttenlocher, Jon M. Klei...
CVPR
2009
IEEE
15 years 4 months ago
Contextual decomposition of multi-label images
Most research on image decomposition, e.g. image segmentation and image parsing, has predominantly focused on the low-level visual clues within single image and neglected the cont...
Teng Li, Tao Mei, Shuicheng Yan, In-So Kweon, Chil...