548 search results - page 10 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
115
click to vote
COCOON
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
99
Voted
LISP
2008
14 years 11 months ago
2008
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
109
Voted
DEBU
2010
14 years 9 months ago
2010
Developing high-quality information extraction (IE) rules, or extractors, is an iterative and primarily manual process, extremely time consuming, and error prone. In each iteratio...