A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Filters
Preferential path profiling
2007
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '07
Preserved Fulltext
We present a new algorithm called preferential path profiling (PPP), that reduces the overhead of path profiling. ...
PPP achieves low overhead by separating interesting paths from other paths and assigning a set of unique and compact numbers to these interesting paths. ...
Preferential path profiling labels the paths of interest compactly using a novel numbering scheme. ...
doi:10.1145/1190216.1190268
dblp:conf/popl/VaswaniNC07
fatcat:iumsm5c7tnc5zmmzkqiq2ry274
Preferential path profiling
2007
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We present a new algorithm called preferential path profiling (PPP), that reduces the overhead of path profiling. ...
PPP achieves low overhead by separating interesting paths from other paths and assigning a set of unique and compact numbers to these interesting paths. ...
Preferential path profiling labels the paths of interest compactly using a novel numbering scheme. ...
doi:10.1145/1190215.1190268
fatcat:bhmjwjcbcjb5djzsykcapulbqq
Quantifying the effectiveness of testing via efficient residual path profiling
2007
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We also show that residual edge profiling is inadequate as a significant number of untested paths include no new untested edges. ...
Recent advances in low-overhead path profiling provide the opportunity to rectify this deficiency and perform residual path profiling on deployed software. ...
First, we use PPP to compactly number interesting paths in the supergraph. ...
doi:10.1145/1287624.1287706
dblp:conf/sigsoft/ChilimbiNV07
fatcat:7mvcmyu6jjds7ogkwxebzbc5wm
Quantifying the effectiveness of testing via efficient residual path profiling
2007
The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering companion papers - ESEC-FSE companion '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We also show that residual edge profiling is inadequate as a significant number of untested paths include no new untested edges. ...
Recent advances in low-overhead path profiling provide the opportunity to rectify this deficiency and perform residual path profiling on deployed software. ...
First, we use PPP to compactly number interesting paths in the supergraph. ...
doi:10.1145/1295014.1295037
fatcat:4den4dsbcbgxvc4en474ggqlkm
From receptive profiles to a metric model of V1
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this work we show how to construct connectivity kernels induced by the receptive profiles of simple cells of the primary visual cortex (V1). ...
Our construction adapts to any bank of filters chosen to represent a set of receptive profiles, since it does not require any structure on the parameterization of the family. ...
Left: the "area of influence" of a cell and some of the possible paths departing from it. ...
arXiv:1803.05783v2
fatcat:shl6yzhti5ba7cqnwhabj7mhpi
Some Representation and Computational Issues in Social Choice
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
, roughly speaking, is the sum, for all agents, of the numbers of pairs of alternatives on which the aggregated profile disagrees with the agent's profile. ...
The two voters whose true preference is xy xȳ xȳ xy have an interest to report an insincere preference profile with xȳ on top, that is, to vote for xȳ -in that case, the winner is xȳ, which these two voters ...
doi:10.1007/11518655_3
fatcat:7yk4ziiuajg2hafakyqhq64xsi
Aggregating CP-nets with Unfeasible Outcomes
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
of features describing the candidates and in the number of voters. ...
, and the collection of CP-nets is O-legal (that is, the dependency graphs of the CP-nets are compatible), we show that our more general voting procedure can be used, and that it is polynomial in the number ...
In this paper we are interested in modeling and studying these scenarios. ...
doi:10.1007/978-3-319-10428-7_28
fatcat:z3sk32ihojb6jgigntzl74skeu
A network perspective on the topological importance of enzymes and their phylogenetic conservation
2007
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
centrality measuring how frequently a node appears on all shortest paths between two other nodes. ...
We ask if there are relationships between the phylogenetic profile of an enzyme, or the number of different bacterial species that contain it, and its topological importance in the metabolic network. ...
paths between nodes j and k; and g jk (i) is the number of these shortest paths to which node i is incident. ...
doi:10.1186/1471-2105-8-121
pmid:17425808
pmcid:PMC1955749
fatcat:xnrptihzcnbdvpqrseumls5ymy
A mathematical model of neuromuscular adaptation to resistance training and its application in a computer simulation of accommodating loads
2010
European Journal of Applied Physiology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The key element of the proposed model is what is here termed the athlete's capability profile. ...
Simulation results are used to infer the adaptational stimulus, which manifests itself through a fed back modification of the capability profile. ...
It also opens a number of avenues for future work. Of most immediate interest are extensions of the model which include more sophisticated aspects of the muscle's stretch-shorten cycle. ...
doi:10.1007/s00421-010-1526-3
pmid:20544357
fatcat:3s7j6b73aratbck6nrjqtrafne
Black-box analysis of Internet P2P applications
2010
Peer-to-Peer Networking and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Fi-
ward path. ...
discovery phase, we further upper-bound the number of con-
In the remainder of this section, we briefly explain the currently active path-probing processes at C = 50. ...
doi:10.1007/s12083-010-0072-4
fatcat:wtqil7grffg65m3uo4s54bfy5u
Atmospheric effects in satellite imaging of mountainous terrain
1983
Applied Optics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A number of ways of determining the model parameters are discussed, including the use of shadows to obtain path radiance and to estimate local albedo and sky irradiance. ...
The model incorporates path radiance and illumination from sun and sky and their dependencies on surface altitude and orientation. ...
He exhibited altitude profiles of sensor radiance that clearly showed a regular variation of path radiance with altitude. This variation can be exploited to help find path radiance.
C. ...
doi:10.1364/ao.22.001702
pmid:18196019
fatcat:6qxawwzz7rf7rmzirbejb7nala
Modeling Morphology of Social Network Cascades
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
For a given graph, the number of unique paths between nodes is proportional to the number of spanning trees. ...
., k}, where the number of classes k is usually very small. In our case, we are interested in the traditional binary classifier with k = 2. ...
arXiv:1302.2376v1
fatcat:wg4ibw3nazfhpbglr7xy6fwpnu
Reasoning with PCP-Nets
2021
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
It is interesting to observe that adding a pair pC i , 0q to a profile of CP-nets will change the LS result. ...
from a generic profile may have an exponential number of cp-statements. ...
PLUR takes the optimal outcome of each CP-net and returns the outcome which is optimal for the largest number of CP-nets. ...
doi:10.1613/jair.1.13009
fatcat:hm6nefnq3bedpmshwbt2yg346u
Towards an integrated understanding of the structural characteristics of protein residue networks
2011
Theory in biosciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2010 pre-print arXiv:1011.2222v1 fatcat:io4vgtkry5gl7e3uzf43uefuwqOther Versions
It appears that there are yet interesting discussions to be had on this topic.
Average Path Length Average path length of a network is the average shortest path between all node-pairs. ...
is a given, but what is more interesting and pertinent is the way the decrease happens). ...
doi:10.1007/s12064-011-0135-y
pmid:21948188
fatcat:qdracnezfrcf7cp54xuz4o3lvi
Compact preference representation and Boolean games
2008
Autonomous Agents and Multi-Agent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Yet another interesting issue for further research stems from the observation that is often unnatural to require players to express preference relations over strategy profiles. ...
There is an interesting equivalent way of defining weak and strong Nash equilibria. ...
Consider the strategy profile for G defined by assigning each x i as in x, each p i as x i , and each γ i to true. It is easily checked that this strategy profile is a PNE for G. ...
doi:10.1007/s10458-008-9040-2
fatcat:lhr3egphevcujp6jjyp46zijum
« Previous
Showing results 1 — 15 out of 483 results