• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 45,711
Next 10 →

Topic-Sensitive PageRank

by Taher Haveliwala , 2002
"... In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search resu ..."
Abstract - Cited by 543 (10 self) - Add to MetaCart
results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. By using these (precomputed) biased PageRank vectors to generate query-specific importance scores for pages at query

Random forests

by Leo Breiman, E. Schapire - Machine Learning , 2001
"... Abstract. Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the fo ..."
Abstract - Cited by 3613 (2 self) - Add to MetaCart
. Schapire, Machine Learning: Proceedings of the Thirteenth International conference, ∗∗∗, 148–156), but are more robust with respect to noise. Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the splitting

"GrabCut” -- interactive foreground extraction using iterated graph cuts

by Carsten Rother, Vladimir Kolmogorov, Andrew Blake - ACM TRANS. GRAPH , 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract - Cited by 1130 (36 self) - Add to MetaCart
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors

ℓ-diversity: Privacy beyond k-anonymity

by Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, Muthuramakrishnan Venkitasubramaniam - IN ICDE , 2006
"... Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called k-anonymity has gained popularity. In a k-anonymized dataset, each record is indistinguishable from at least k − 1 other records with resp ..."
Abstract - Cited by 672 (13 self) - Add to MetaCart
Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called k-anonymity has gained popularity. In a k-anonymized dataset, each record is indistinguishable from at least k − 1 other records

Real-Time Systems

by Fan Liu, Ajit Narayanan, Quan Bai , 2000
"... Collision avoidance is an important topic in multi-robot systems. Existing multi-robot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same time-step) [1, 3, 4], and allow diagonal move between ..."
Abstract - Cited by 602 (11 self) - Add to MetaCart
Collision avoidance is an important topic in multi-robot systems. Existing multi-robot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same time-step) [1, 3, 4], and allow diagonal move

k-anonymity: a model for protecting privacy.

by Latanya Sweeney - International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, , 2002
"... Consider a data holder, such as a hospital or a bank, that has a privately held collection of person-specific, field structured data. Suppose the data holder wants to share a version of the data with researchers. How can a data holder release a version of its private data with scientific guarantees ..."
Abstract - Cited by 1313 (15 self) - Add to MetaCart
policies are respected. The k-anonymity protection model is important because it forms the basis on which the real-world systems known as Datafly, µ-Argus and k-Similar provide guarantees of privacy protection.

Base-calling of automated sequencer traces using phred. I. Accuracy Assessment

by Brent Ewing, Ladeana Hillier, Michael C. Wendl, Phil Green - GENOME RES , 1998
"... The availability of massive amounts of DNA sequence information has begun to revolutionize the practice of biology. As a result, current large-scale sequencing output, while impressive, is not adequate to keep pace with growing demand and, in particular, is far short of what will be required to obta ..."
Abstract - Cited by 1653 (4 self) - Add to MetaCart
to obtain the 3-billion-base human genome sequence by the target date of 2005. To reach this goal, improved automation will be essential, and it is particularly important that human involvement in sequence data processing be significantly reduced or eliminated. Progress in this respect will require both

A logic of authentication

by Michael Burrows, Martín Abadi, Roger Needham - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1990
"... Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required ..."
Abstract - Cited by 1332 (22 self) - Add to MetaCart
Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required

Climate and atmospheric history of the past 420,000 years from the Vostok ice core,

by J R Petit , J Jouzel , D Raynaud , N I Barkov , J.-M Barnola , I Basile , M Bender , J Chappellaz , M Davisk , G Delaygue , M Delmotte , V M Kotlyakov , M Legrand , V Y Lipenkov , C Lorius , L Pé , C Ritz , E Saltzmank , M Stievenard - Antarctica. Nature , 1999
"... Antarctica has allowed the extension of the ice record of atmospheric composition and climate to the past four glacial-interglacial cycles. The succession of changes through each climate cycle and termination was similar, and atmospheric and climate properties oscillated between stable bounds. Inte ..."
Abstract - Cited by 716 (15 self) - Add to MetaCart
. Interglacial periods differed in temporal evolution and duration. Atmospheric concentrations of carbon dioxide and methane correlate well with Antarctic air-temperature throughout the record. Present-day atmospheric burdens of these two important greenhouse gases seem to have been unprecedented during the past

On the Plurality of Worlds

by David Lewis, Louis Derosset , 1986
"... David Lewis is one of the most influential philosophers of our age, and On the Plurality of Worlds is his magnum opus. OPW1 offers an extended development and defense of the hypothesis that there are many universes, things of the same kind as the universe in which we all live, move, and have our bei ..."
Abstract - Cited by 687 (2 self) - Add to MetaCart
with respect to what goes on in them. Lewis sought in earlier work (Lewis, 1973, pp. 84–86) to offer a direct argument from common sense modal commitments to the existence of a plurality of worlds.2 OPW offers a less direct argument. Here, Lewis supports the hypothesis by arguing that, if we accept it, we have
Next 10 →
Results 1 - 10 of 45,711
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University