Sciweavers

1170 search results - page 206 / 234
» How Fast Is Too Fast
Sort
View
120
Voted
ICALP
2009
Springer
16 years 1 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
87
Voted
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 10 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
120
Voted
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
TouchTone: Interactive Local Image Adjustment Using Point-and-Swipe
Recent proliferation of camera phones, photo sharing and social network services has significantly changed how we process our photos. Instead of going through the traditional dow...
Chia-Kai Liang, Wei-Chao Chen, Natasha Gelfand
101
Voted
ASPLOS
2010
ACM
15 years 8 months ago
ParaLog: enabling and accelerating online parallel monitoring of multithreaded applications
Instruction-grain lifeguards monitor the events of a running application at the level of individual instructions in order to identify and help mitigate application bugs and securi...
Evangelos Vlachos, Michelle L. Goodstein, Michael ...
90
Voted
ICC
2009
IEEE
112views Communications» more  ICC 2009»
15 years 7 months ago
Push Popular Segments in P2P VoD System: Possibility and Design
—Video-on-Demand (VoD) services have attracted a lot of attentions in recent years. Measurement studies show that VCR (Video Cassette Recorder) operations, such as pause, rewind,...
Junfeng Xie, Edward Chan, Guihai Chen, Yang Guo