Sciweavers

198 search results - page 3 / 40
» A Framework for Dynamizing Succinct Data Structures
Sort
View
FOCS
2009
IEEE
15 years 1 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
KBSE
1998
IEEE
15 years 1 months ago
An Automated Framework for Structural Test-Data Generation
Structural testing criteria are mandated in many software development standards and guidelines. The process of generating test-data to achieve 100 coverage of a given structural c...
Nigel Tracey, John A. Clark, Keith Mander, John A....
JDA
2006
184views more  JDA 2006»
14 years 9 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
117
Voted
BIOCOMP
2006
14 years 10 months ago
Dynamic Bayesian Network (DBN) with Structure Expectation Maximization (SEM) for Modeling of Gene Network from Time Series Gene
Exploring gene regulatory network is a key topic in molecular biology. In this paper, we present a new dynamic Bayesian network (DBN) framework embedded with structural expectatio...
Yu Zhang, Zhidong Deng, Hongshan Jiang, Peifa Jia
SPIRE
2010
Springer
14 years 7 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi