Sciweavers

886 search results - page 127 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 3 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
ALGORITHMICA
2011
13 years 4 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
IICS
2004
Springer
14 years 3 months ago
Towards Logical Hypertext Structure
Facing the retrieval problem according to the overwhelming set of documents online the adaptation of text categorization to web units has recently been pushed. The aim is to utiliz...
Alexander Mehler, Matthias Dehmer, Rüdiger Gl...
BMCBI
2004
140views more  BMCBI 2004»
13 years 9 months ago
What can we learn from noncoding regions of similarity between genomes?
Background: In addition to known protein-coding genes, large amounts of apparently non-coding sequence are conserved between the human and mouse genomes. It seems reasonable to as...
Thomas A. Down, Tim J. P. Hubbard
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 4 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch