Sciweavers

699 search results - page 104 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
BMCBI
2010
156views more  BMCBI 2010»
14 years 10 months ago
Comparative classification of species and the study of pathway evolution based on the alignment of metabolic pathways
Background: Pathways provide topical descriptions of cellular circuitry. Comparing analogous pathways reveals intricate insights into individual functional differences among speci...
Adi Mano, Tamir Tuller, Oded Béjà, R...
PLPV
2009
ACM
15 years 6 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
FSTTCS
1992
Springer
15 years 1 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
WWW
2005
ACM
15 years 10 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 4 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu