Sciweavers

Share
CIKM
2010
Springer
8 years 9 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
JEA
2010
95views more  JEA 2010»
8 years 9 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...
JIIS
2006
76views more  JIIS 2006»
8 years 11 months ago
Holes in joins
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
Jarek Gryz, Dongming Liang
BMCBI
2007
147views more  BMCBI 2007»
8 years 11 months ago
Predicting combinatorial binding of transcription factors to regulatory elements in the human genome by association rule mining
Background: Cis-acting transcriptional regulatory elements in mammalian genomes typically contain specific combinations of binding sites for various transcription factors. Althoug...
Xochitl C. Morgan, Shulin Ni, Daniel P. Miranker, ...
COMPSAC
2008
IEEE
8 years 11 months ago
Superfit Combinational Elusive Bug Detection
Software that has been well tested and analyzed may fail unpredictably when a certain combination of conditions occurs. In Bounded Exhaustive Testing (BET) all combinations are te...
R. Barzin, S. Fukushima, William E. Howden, S. Sha...
ICDE
2010
IEEE
167views Database» more  ICDE 2010»
8 years 11 months ago
Top-k pipe join
Abstract—In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether diffe...
Davide Martinenghi, Marco Tagliasacchi
CEC
2003
IEEE
9 years 4 months ago
Comparison of sampling sizes for the co-evolution of cooperative agents
Abstract -_The evolution of a heterogeneousteam behavior can he a very demanding task. In order to promote the greatest level of specialization team members should be evolved in se...
Gary B. Parker, H. Joseph Blumenthal
IEEEARES
2008
IEEE
9 years 5 months ago
A Critique of k-Anonymity and Some of Its Enhancements
k-Anonymity is a privacy property requiring that all combinations of key attributes in a database be repeated at least for k records. It has been shown that k-anonymity alone does...
Josep Domingo-Ferrer, Vicenç Torra

Book
3022views
10 years 7 months ago
Algorithms for Programmers
"This is the (work in progress) book "Algorithms for Programmers". Publication as soon as possible, content is (modulo copy editing) close to final version. I will p...
Jörg Arndt
books