Sciweavers

1456 search results - page 254 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 10 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 9 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
MOBISYS
2004
ACM
14 years 7 months ago
Exponential Index: A Parameterized Distributed Indexing Scheme for Data on Air
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...
Jianliang Xu, Wang-Chien Lee, Xueyan Tang
KBSE
2009
IEEE
14 years 2 months ago
Alattin: Mining Alternative Patterns for Detecting Neglected Conditions
—To improve software quality, static or dynamic verification tools accept programming rules as input and detect their violations in software as defects. As these programming rul...
Suresh Thummalapenta, Tao Xie
ISSTA
2010
ACM
13 years 11 months ago
Automatic detection of unsafe component loadings
Dynamic loading of software components (e.g., libraries or modules) is a widely used mechanism for improved system modularity and flexibility. Correct component resolution is cri...
Taeho Kwon, Zhendong Su