Sciweavers

1284 search results - page 180 / 257
» Data Structures for Mergeable Trees
Sort
View
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
IPPS
2007
IEEE
15 years 4 months ago
A Key-based Adaptive Transactional Memory Executor
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...
Tongxin Bai, Xipeng Shen, Chengliang Zhang, Willia...
NIPS
2008
14 years 11 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould
ISSTA
2004
ACM
15 years 3 months ago
Test input generation with java PathFinder
We show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. We focus on ...
Willem Visser, Corina S. Pasareanu, Sarfraz Khursh...
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
15 years 3 months ago
Automatic Web Page Classification in a Dynamic and Hierarchical Way
Automatic classification of web pages is an effective way to deal with the difficulty of retrieving information from the Internet. Although there are many automatic classification...
Xiaogang Peng, Ben Choi