Registrer deg | Logg på | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

ariels' library [51 articles]

Nye artikler sendt til ariels' bibliotek.
  • Lock-free linked lists and skip lists
    (2004), pp. 50-59.
    by M Fomitchev, E Ruppert
    posted to synchronization programming multithreading by ariels on 2008-06-28 15:42:12 as **** along with 1 person shanir
  • Swift: A Fast Dynamic Packet Filter
    by Zhenyu Wu, Mengjun Xie, Haining Wang
    posted to programming packet-capture operating-systems networking high-performance by ariels on 2008-06-26 11:02:58 as ***
  • FastForward for Efficient Pipeline Parallelism
    (April 2007)
    by John Giacomoni, Tipp Moseley, Manish Vachharajani
    posted to programming multithreading lockfree by ariels on 2008-06-02 11:36:59 as ***
  • Quantifying the performance of garbage collection vs. explicit memory management
    by Matthew Hertz
    posted to programming memory by ariels on 2008-06-01 08:16:41 as **
  • Playing by the rules: rewriting as a practical optimisation technique
    (2001)
    by S Jones, T Hoare, A Tolmach
    posted to functional programming-languages by ariels on 2008-04-22 16:26:20 as *** along with 1 person dfisher
  • Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
    (1996), pp. 267-275.
    by Maged M Michael, Michael L Scott
    posted to multithreading programming synchronization by ariels on 2008-04-15 16:50:44 as **** along with 1 person myui
  • notes Fast String Search on Multicore Processors
    Dr. Dobbs' Journal (April 2008)
    by Daniele P Scarpazza, Oreste Villa, Fabrizio Petrini
    posted to multithreading programming by ariels on 2008-04-13 14:37:13 as ****
  • Lest We Remember: Cold Boot Attacks on Encryption Keys
    by Alex J Halderman, Seth D Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A Calandrino, Ariel J Feldman, Jacob Appelbaum, Edward W Felten
    posted to hardware security by ariels on 2008-02-24 13:54:01 as *****
  • 100% Accuracy in Automatic Face Recognition
    Science, Vol. 319, No. 5862. (25 January 2008), 435.
    by R Jenkins, AM Burton
    posted to algorithm by ariels on 2008-01-29 07:36:02 as ** along with 4 people and 1 group evansd66 cmunson shivakmr yuhc VisionLab
  • Software and hardware prototypes of the IEEE 1588 precision time protocol on wireless LAN Software and hardware prototypes of the IEEE 1588 precision time protocol on wireless LAN
    Local and Metropolitan Area Networks, 2005. LANMAN 2005. The 14th IEEE Workshop on (2005), 6 pp..
    by J Kannisto, J Kannisto, T Vanhatupa, T Vanhatupa, M Hannikainen, M Hannikainen, TD Hamalainen
    posted to hardware time wlan by ariels on 2007-12-17 14:28:01 as ****
  • An approximation to the greedy algorithm for differential compression
    by RC Agarwal, K Gupta, S Jain, S Amalapurapu
    posted to algorithm compression string suffix-array by ariels on 2007-12-02 12:11:03 as **
  • Improved Algorithms for Synchronizing Computer Network Clocks
    IEEETNWKG: IEEE/ACM Transactions on NetworkingIEEE Communications Society, IEEE Computer Society and the ACM with its Special Interest Group on Data Communication (SIGCOMM), ACM Press, Vol. 3 (1995)
    by Mills David
    posted to algorithm synchronization time by ariels on 2007-11-22 12:35:49 as ****
  • Concurrent programming without locks
    ACM Trans. Comput. Syst., Vol. 25, No. 2. (May 2007)
    by Keir Fraser, Tim Harris
    posted to cas lockfree multithreading novel programming waitfree by ariels on 2007-11-07 07:58:15 as ** along with 4 people mwmarkland brecknell jdinan getpost
  • Positivity of cubic polynomials on intervals and positive spline interpolation
    BIT Numerical Mathematics, Vol. 28, No. 2. (1 June 1988), pp. 340-352.
    by Jochen W Schmidt, Walter Heß
    posted to algorithms graphics numerical-analys by ariels on 2007-10-30 11:49:27 as ***
  • A Tutorial on Learning With Bayesian Networks
    (March 1995)
    by David Heckerman
    posted to bayesian-network graph probability by ariels on 2007-10-25 16:57:52 as *** along with 1 person pcahan1
  • notes Iterators: Signs of Weakness in Object-Oriented Languages
    ACM OOPS Messenger, Vol. 4, No. 3. (1993), pp. 18-25.
    by Henry G Baker
    posted to compilers computation continuations functional good object-oriented programming wrong by ariels on 2007-09-28 12:24:19 as read
  • Maximum Likelihood Estimation of a Compound Poisson Process
    The Annals of Statistics, Vol. 4, No. 6. (1976), pp. 1200-1209.
    by Leopold Simar
    posted to maximum-likelihood poisson-process probability statistics by ariels on 2007-09-28 12:18:28 as ** along with 1 person abrentnall
  • Portable Multithreading-The Signal Stack Trick for User-Space Tliread Creation
    pp. 239-250.
    by Ralf S Engelschall
    posted to multithreading novel operating-systems programming by ariels on 2007-09-27 20:01:24 as read along with 1 person aliguori
  • Algorithm Design
    (16 March 2005)
    by Jon Kleinberg, Éva Tardos
    posted to algorithms correctness programming by ariels on 2007-09-27 11:09:30 as ** along with 4 people edvin BarrosH pprett wonjongchung
  • Programming Language Pragmatics, Second Edition
    (07 November 2005)
    by Michael L Scott
    posted to compilers programming programming-languages by ariels on 2007-09-27 11:08:03 as **** along with 1 person BelliOS
  • Quantum threat to our secret data
    New Scientist, No. 2621. (13 September 2007), 30.
    by Saswato
    posted to computation crypto quantum by ariels on 2007-09-17 10:51:14 as **
  • Exploiting Concurrency Vulnerabilities in System Call Wrappers
    by Robert N Watson
    posted to firewall multithreading operating-systems security by ariels on 2007-09-17 08:10:13 as ****
  • Simple linear work suffix array construction
    (2003)
    by J Kärkkäinen, P Sanders
    posted to algorithm pattern-matching programming string substring text by ariels on 2007-09-09 13:19:04 as *** along with 2 people whym tmarscha
  • Engineering a lightweight suffix array construction algorithm (Extended Abstract)
    by Giovanni Manzini, Paolo Ferragina
    posted to algorithm pattern-matching programming retrieval searching string substring text by ariels on 2007-09-09 13:17:57 as ****
  • Approximate fingerprinting to accelerate pattern matching
    (2006), pp. 301-306.
    by Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannaccone
    posted to algorithm networking pattern-matching programming searching string substring text by ariels on 2007-09-09 07:00:39 as *** along with 1 person mfisk
  • From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
    Algorithmica, Vol. 19, No. 3. (1997), pp. 331-353.
    by Robert Giegerich, Stefan Kurtz
    posted to algorithm string substring text by ariels on 2007-09-05 12:54:52 as **** along with 6 people and 1 group tijl luispedro hoangmit treangen sugarexpletive whym Pattern-Analysis
  • Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets
    Combinatorial Pattern Matching (2005), pp. 168-177.
    by Shiri Dori, Gad M Landau
    posted to algorithm string substring text by ariels on 2007-09-05 12:22:40 as **** along with 1 person whym
  • Pattern Matching in Trees and Strings
    (31 Aug 2007)
    by Philip Bille
    posted to algorithm dynamic-programming string subsequence substring text by ariels on 2007-09-05 12:15:17 as **** along with 6 people and 3 groups egh A_Olympia jrw rahul pirapira yangxian Philosophy_of_Information Blog_and_Wiki_Research SRL
  • notes Split-ordered lists: Lock-free extensible hash tables
    J. ACM, Vol. 53, No. 3. (May 2006), pp. 379-405.
    by Ori Shalev, Nir Shavit
    posted to algorithm cas computation distributed lockfree multithreading waitfree by ariels on 2007-09-03 12:32:09 as *** along with 4 people and 1 group jrw rahul damaru myui SRL
  • Hypercomputation: computing more than the Turing machine
    (25 Sep 2002)
    by Toby Ord
    posted to computation free-lunch something-for-nothing wrong by ariels on 2007-09-03 12:28:35 as read along with 3 people BrendaChng scis0000001 BrianTomasik
  • A simple min-cut algorithm
    J. ACM, Vol. 44, No. 4. (July 1997), pp. 585-591.
    by Mechthild Stoer, Frank Wagner
    posted to algorithm graph linear-programming max-flow min-cut probabilistic random by ariels on 2007-08-25 16:24:38 as **** along with 2 people mmartin chrisatcite
  • notes An Optical Solution For The Traveling Salesman Problem
    Optics Express, Vol. 15, No. 16. (2007), pp. 10473-10482.
    by Tobias Haist, Wolfgang Osten
    posted to algorithm computation np-complete physical-computation by ariels on 2007-08-12 13:31:01 as ***
  • Garbage Collection Without Paging
    by Matthew Hertz, Yi Feng, Emery D Berger
    posted to garbage-collection programming by ariels on 2007-08-12 12:07:52 as *** along with 3 people tautologico pedagand peni
  • Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications
    (2001), pp. 149-160.
    by Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, Hari Balakrishnan
    posted to algorithm dht distributed networking p2p programming by ariels on 2007-08-12 11:00:52 as read along with 17 people and 4 groups dmeister pdlug scottmoody pool007 jmlon rblake cchhrriiss fmc smallbadguy mrkoot utopianheaven adri davcer pedagand gvdh hayeah sfuniak 18th-century_history_culture_and_society semantic-multicast-routing SNE uiuc-cs
  • The Chord Ad-hoc Routing Protocol
    by George P Kevin
    posted to dht distributed hash programming by ariels on 2007-08-12 10:59:51 as read
  • Algebraic topology and concurrency
    Theoretical Computer Science, Vol. 357, No. 1-3. (25 July 2006), pp. 241-278.
    by Lisbeth Fajstrup, Martin Rau[ss]en, Eric Goubault
    posted to algebra algorithms geometry multithreading topology by ariels on 2007-08-12 10:55:56 as ** along with 1 person and 1 group AbnerCYH CSBBGraphTheory
  • Proof-carrying code
    (1997), pp. 106-119.
    by George C Necula
    posted to correctness logic programming theory by ariels on 2007-08-12 07:02:28 as read along with 3 people and 1 group dsilva emiliorp mfrydr complogic
  • Beautiful Code: Leading Programmers Explain How They Think (Theory in Practice (O'Reilly))
    (26 June 2007)
    by Andy Oram, Greg Wilson
    posted to correctness multithreading programming by ariels on 2007-08-12 07:00:50 as *** along with 4 people moggis2 erisu BastianSpanneberg jasmithoffice
  • Scene Completion Using Millions of Photographs
    ACM Transactions on Graphics, Vol. 26, No. 3. (August 2007)
    by James Hays, Alexei A Efros
    posted to algorithm fill-in-the-blanks graphics image-analysis images imaging reconstruction by ariels on 2007-08-09 11:40:33 as ***
  • Scalable lock-free dynamic memory allocation
    SIGPLAN Not., Vol. 39, No. 6. (May 2004), pp. 35-46.
    by Maged M Michael
    posted to cas computation lockfree multithreading programming waitfree by ariels on 2007-08-07 10:03:05 as ****
  • Secure Broadcast Communication: In Wired and Wireless Networks
    (01 October 2002)
    by Adrian Perrig, JD Tygar
    posted to broadcast crypto multicast networking security by ariels on 2007-08-05 08:16:46 as read along with 1 person HailunTan
  • notes Lock-Free Data Structures with Hazard Pointers
    C/C++ Users Journal, No. December. (2004)
    by A Alexandrescu, Maged M Michael
    posted to cas lockfree multithreading programming waitfree by ariels on 2007-08-05 07:38:21 as read
  • A new approach to text searching
    (1989), pp. 168-175.
    by Baeza RA Yates, GH Gonnet
    edited by NJ Belkin, CJ van Rijsbergen
    posted to information matching retrieval searching string substring text by ariels on 2007-08-02 16:26:19 as **
  • Estimating the heavy tail index from scaling properties
    (1999)
    by M Crovella, M Taqqu
    posted to computation heavy-tail probability statistics by ariels on 2007-08-02 16:24:23 as read
  • Computational strategies for the Riemann zeta function
    (1998)
    by J Borwein, D Bradley, R Crandall
    posted to computation floating-point by ariels on 2007-08-02 16:23:00 as read along with 1 person muraken
  • notes Authoritative sources in a hyperlinked environment
    Journal of the ACM, Vol. 46, No. 5. (1999), pp. 604-632.
    by Jon M Kleinberg
    posted to google information pagerank retrieval by ariels on 2007-08-02 13:28:08 as read along with 30 people and 6 groups lior korakot pdlug ldfu macartisan carlblesius donturn akrowne halacsy ChaTo ldietz pferguson MaineC srinaths wcohen tolosoft matteodellamico ddahlem donade gane5h scis0000001 taho merazzle scholze sudhanshu_goswami lillejul matwendt brontolo jiny clickstone Philosophy_of_Information Blog_and_Wiki_Research mgh-lcs hst-bmi L3S oktave-labs
  • Semi-local string comparison: algorithmic techniques and applications
    (24 Jul 2007)
    by Alexander Tiskin
    posted to dynamic-programming lcs matching smith-waterman subsequence substring by ariels on 2007-08-02 13:26:56 as ** along with 2 people jrw ima
  • notes Hazard pointers: Safe memory reclamation for lock-free objects
    IEEE Transactions on Parallel Distributed Systems, Vol. 15, No. 6. (2004), pp. 491-504.
    by Maged M Michael
    posted to cas lockfree multithreading novel programming waitfree by ariels on 2007-08-02 10:12:52 as read
  • notes Critical percolation on certain non-unimodular graphs
    (27 Oct 2005)
    by Yuval Peres, Gabor Pete, Ariel Scolnicov
    posted to graph percolation probability theory by ariels on 2007-08-02 10:03:46 as read
  • Controlling Effects
    (May 1996)
    by Andrzej Filinski
    posted to functional monads by ariels on 2007-08-02 09:59:07 as ** along with 1 person harshrc
    • NB: Du kan sitere denne siden som: http://www.citeulike.org/user/ariels

    Result page: 1 2 Next RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.