• 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 1,711
Next 10 →

Tandem repeats finder: a program to analyze DNA sequences

by Gary Benson , 1999
"... A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size, co ..."
Abstract - Cited by 961 (9 self) - Add to MetaCart
A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size

Tapestry: A Resilient Global-scale Overlay for Service Deployment

by Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, John D. Kubiatowicz - IEEE Journal on Selected Areas in Communications , 2004
"... We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, locationindependent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API ..."
Abstract - Cited by 598 (14 self) - Add to MetaCart
We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, locationindependent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

by Antony Rowstron, Peter Druschel , 2001
"... This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract - Cited by 803 (23 self) - Add to MetaCart
additional copies of popular files. In the PAST system, storage nodes and files are each assigned uniformly distributed identifiers, and replicas of a file are stored at nodes whose identifier matches most closely the file’s identifier. This statistical assignment of files to storage nodes approximately

Graphcut textures: Image and video synthesis using graph cuts

by Vivek Kwatra, Arno Schödl, Irfan Essa, Greg Turk, Aaron Bobick - ACM Transactions on Graphics, SIGGRAPH 2003 , 2003
"... This banner was generated by merging the source images in Figure 6 using our interactive texture merging technique. In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample image or video are transformed and copied to the output a ..."
Abstract - Cited by 490 (9 self) - Add to MetaCart
This banner was generated by merging the source images in Figure 6 using our interactive texture merging technique. In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample image or video are transformed and copied to the output

Approximate Graph Coloring by Semidefinite Programming.

by David Karger , Rajeev Motwani , D Karger , M Sudan - In Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science, , 1994
"... Abstract. We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on n vertices with min{O(⌬ 1/3 log 1/2 ⌬ log n), O(n 1/4 log 1/2 n)} colors where ⌬ is the maximum degree of any vertex ..."
Abstract - Cited by 210 (7 self) - Add to MetaCart
vertex. Besides giving the best known approximation ratio in terms of n, this marks the first nontrivial approximation result as a function of the maximum degree ⌬. This result can be generalized to k-colorable graphs to obtain a coloring using min{O(⌬ 1Ϫ2/k log 1/2 ⌬ log n), O(n 1Ϫ3/(kϩ1) log 1/2 n

Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets

by Bevan Das, Vaduvur Bharghavan , 1997
"... this paper, we impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) ..."
Abstract - Cited by 297 (3 self) - Add to MetaCart
, to keep the virtual backbone as small as possible, we use an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs

The diploid genome sequence of an individual human

by Samuel Levy, Granger Sutton, Pauline C. Ng, Lars Feuk, Aaron L. Halpern, Brian P. Walenz, Nelson Axelrod, Jiaqi Huang, Ewen F. Kirkness, Gennady Denisov, Yuan Lin, Jeffrey R. Macdonald, Andy Wing, Chun Pang, Mary Shago, Timothy B. Stockwell, Alexia Tsiamouri, Vineet Bafna, Vikas Bansal, Saul A. Kravitz, Dana A. Busam, Karen Y. Beeson, Tina C. Mcintosh, Karin A. Remington, Josep F. Abril, John Gill, Jon Borman, Yu-hui Rogers, Marvin E. Frazier, Stephen W. Scherer, Robert L. Strausberg, J. Craig Venter - PLoS Biol
"... Presented here is a genome sequence of an individual human. It was produced from;32 million random DNA fragments, sequenced by Sanger dideoxy technology and assembled into 4,528 scaffolds, comprising 2,810 million bases (Mb) of contiguous sequence with approximately 7.5-fold coverage for any given r ..."
Abstract - Cited by 293 (6 self) - Add to MetaCart
Presented here is a genome sequence of an individual human. It was produced from;32 million random DNA fragments, sequenced by Sanger dideoxy technology and assembled into 4,528 scaffolds, comprising 2,810 million bases (Mb) of contiguous sequence with approximately 7.5-fold coverage for any given

Developments in the Measurement of Subjective Well-Being

by Daniel Kahneman , Alan B Krueger - Psychological Science. , 1993
"... F or good reasons, economists have had a long-standing preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract - Cited by 284 (7 self) - Add to MetaCart
of Economic Yet another use of subjective well-being has been to provide an external check on economic indicators. For example, Nordhaus (1998) and What are economists to make of this enterprise? Can well-being be measured by a subjective survey, even approximately? In this paper, we discuss research on how

Beam tracing polygonal objects

by Paul S Heckbert , Pat Hanrahan - In Computer Graphics (Proceedings of ACM SIGGRAPH , 1984
"... Abstract Ray tracing has produced some of the most realistic computer generated pictures to date. They contain surface texturing, local shading, shadows, reflections and refractions. The major disadvantage of ray tracing results from its point-sampling approach. Because calculation proceeds ab init ..."
Abstract - Cited by 214 (1 self) - Add to MetaCart
the reflections are linear transformations, and refractions are often approximately so. The recursive beam tracer begins by sweeping the projection plane through the scene. Beam-surface intersections are computed using two-dimensional polygonal set operations and an occlusion algorithm similar to the Weiler

Adaptive precision setting for cached approximate values

by Chris Olston, Boon Thau Loo, Jennifer Widom - In Proc. ACM SIGMOD , 2001
"... Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cached approximations must be of appropriate precision: approximations that are too precise easily become invalid, requiring ..."
Abstract - Cited by 131 (5 self) - Add to MetaCart
, or workload vary. We consider interval approximations to numeric values but our ideas can be extended to other kinds of data and approximations. Our algorithm strictly generalizes previous adaptive caching algorithms for exact copies: we can set parameters to require that all approximations be exact, in which
Next 10 →
Results 1 - 10 of 1,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