Sciweavers

417 search results - page 75 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
DLOG
2008
13 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
RECOMB
2002
Springer
14 years 7 months ago
Comparison of minisatellites
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
Eric Rivals, Sèverine Bérard
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 2 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
PLDI
2004
ACM
14 years 24 days ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman
ECCC
2006
88views more  ECCC 2006»
13 years 7 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna