Sciweavers

1731 search results - page 322 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
CIVR
2008
Springer
271views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Multiple feature fusion by subspace learning
Since the emergence of extensive multimedia data, feature fusion has been more and more important for image and video retrieval, indexing and annotation. Existing feature fusion t...
Yun Fu, Liangliang Cao, Guodong Guo, Thomas S. Hua...
POPL
2010
ACM
14 years 5 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
SIGCOMM
2009
ACM
14 years 2 months ago
Towards automated performance diagnosis in a large IPTV network
IPTV is increasingly being deployed and offered as a commercial service to residential broadband customers. Compared with traditional ISP networks, an IPTV distribution network (i...
Ajay Anil Mahimkar, Zihui Ge, Aman Shaikh, Jia Wan...
EJC
2008
13 years 9 months ago
Center Fragments for Upscaling and Verification in Database Semantics
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...
Roland Hausser