myui's tags

1985 1992 1993 1994 1995 1996 1997 1999 2 2000 2001 2002 2003 2004 2005 2006 2007 2008 3 4 4ref 5 80s 90s access-pattern adaptive algebra algorithm amazon amori analysis arc architecture array article atom azul balanced-tree bandwidth basics benchmark binpacking bio bioinformatics bloomfilter book bottleneck btree b-tree bufman cache cache_coherence cache_conscious caching calculi caliculi cap cas catalog catalog-query chip chord cidr cikm classic clock cloudcomputing cluster clustering cmp cmt cmu coding column-oriented commercial_system compilation compiler complexity compress compression concurrency concurrent consensus consistency consistenthash contention context-switch convoy copyonwrite coq corba cost costmodel counter counting cpu cq damon database dataguide data_partitioning datastructure db db2 dblp dbms dbpl deprecated designpattern dewey dexa dht directions discussion disk distributed distributed-query distribution dp dsm dynamic dynamo edbt edit-script encoding encoding-scheme entropy event event_processing experiment falsesharing famous fast fat-btree fault_torelance feeds filesystem fio flash formal formal_semantics fp fsm fts fulltext galax gms google gpgpu gpu grid gst hardware hash hashtable haskell ibm icde icdt idiom index indexfabric inex influential_paper information_integration integration interesting intra-operator intro inverted_file io ir irgs issue issues iterator j japanese java join journal jvm kernel keynote label labeling latch law lazyeval lcs linearizability linux litwin load_blancing locality lock lock-free logic lz machine_lerning main-memory mapping mapreduce mediator memory memorymodel memoryordering mems microsoft mmap mmdb model modern-hardware monad monetdb mq msr multicast multi-dimensional multiproc multi-query multiversion mutex mvcc myui navigational network niagara nonblocking np-hard nsm numa nxdb oltp oodb optimization optimizer oracle orderedsharedlock ordpaths origin os out-of-order overview p2p paging panel paralellism parallel parallelism parallel-joins parsing parssing partialeval partioning partitioning path_index patricia pattern_matching pax paxon paxos pc-cluster perfmon phd phdthesis pi pipeline pipelined pipelined-join pl planx pods predication preemption prefetch probabilistic producer_consumer production programming query query_cache querylang query-processing queue queueing-system queuelock raid range-query rate rdbms reactor read-optimized realtime ref refinement relation relational reliable replication revisit rewriting rmi rpc rss rwlock rxdb s2 sawzall sb-tree scan sched scheme seda self-tuning semi-structured sendfile set-at-a-time shadow-paging sharedmemory shore sigmod skelton skiplist smp smt snapshot-isolation sort spec spinlock ssd ssdbm statemachine stm storage stream string-index stringsearch structual-join structure-index succinct suffixarray suffixtree summary summerization superscalar survey sync synchronization tds techrep temporal term_rewriting theory thesis tlp tool toread tpc tpm tr tradeoff transaction tree tree_skelton trend trie tst tuning tuplespace twig twig-join tx txmem ubm unix unpublished update useful usenix vectorclock vectorizing versioning view viewcomposition viewselection virtualsynch vldb vldbj vmm volcano wait-free wal web webdb websearch widm windowing working-set workload workstealing writing www xbench xbird xime-p xmach xmark xml xml_compression xmldb xml_publishing xml-storage xpath xprs xquery xquery11 xqupdate xsym yahoo yahoor zipf

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.