Search results for "log"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
29	Yi Pan 0001, Keqin Li 0001, Si-Qing Zheng	Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system.	ISPAN	1997	DBLP DOI BibTeX RDF	reconfigurable pipelined bus, nearest neighbor problem, O(log log n)time, n/sup 3/ processors, O(1) time, image processing, binary image, linear array, nearest neighbor algorithms
29	Igor Tatarinov, Alex Rousskov, Valery Soloviev	Static caching in Web servers.	ICCCN	1997	DBLP DOI BibTeX RDF	implementation complexity an, static caching, cache policies, LRU-threshold, LFU, LRU-SIZE, LRU-MIN, LRU-k-threshold, Pitkow/Recker policy, Web document access patterns, request log file, small cache sizes, primary Web servers, CPU overhead, performance analysis, cache performance, log files, online front-ends
29	Paul Hennessey, Mohamed T. Ibrahim, Alexander M. Fedorec	Formal Specification, Object-Oriented Design, and Implementation of an Ephemeral Logger for Database Systems.	DEXA	1996	DBLP DOI BibTeX RDF	Log manager, Ephemeral logging, LLT, Long-Lived Transactions, Object design, Log performance, Formal specification, Transaction processing, Z, Logging, Distributed database systems, OMT
28	Zhen Ming Jiang, Ahmed E. Hassan, Parminder Flora, Gilbert Hamann	Abstracting Execution Logs to Execution Events for Enterprise Applications (Short Paper).	QSIC	2008	DBLP DOI BibTeX RDF	Log Abstraction, Monitoring, Dynamic Analysis, Clone
28	Yue Xu 0001, Li-Tung Weng	Improvement of Web Data Clustering Using Web Page Contents.	Intelligent Information Processing	2004	DBLP DOI BibTeX RDF	clustering, information entropy, Web contents, Web log mining
28	Amr Elmasry	Pairing heaps with O(log log n) decrease cost.	SODA	2009	DBLP DOI BibTeX RDF
28	Bertrand Rivet, Laurent Girin, Christian Jutten	Log-Rayleigh Distribution: A Simple and Efficient Statistical Representation of Log-Spectral Coefficients.	IEEE Trans. Speech Audio Process.	2007	DBLP DOI BibTeX RDF
28	Pascal Paillier, Damien Vergnaud	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log.	ASIACRYPT	2005	DBLP DOI BibTeX RDF
28	Kjetil Nørvåg	Object and Log Management in Temporal Log-Only Object Database Systems.	ADBIS	2001	DBLP DOI BibTeX RDF
28	John R. Punin, Mukkai S. Krishnamoorthy, Mohammed Javeed Zaki	LOGML: Log Markup Language for Web Usage Mining.	WEBKDD	2001	DBLP DOI BibTeX RDF
28	Sajal K. Das 0001, Maria Cristina Pinotti	O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers.	IPPS	1997	DBLP DOI BibTeX RDF
28	David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan	Polygon Triangulation in O(n log log n) Time with Simple Data-Structures.	SCG	1990	DBLP DOI BibTeX RDF
28	Zvi Galil, Éva Tardos	An O(n²(m + n log n)log n) min-cost flow algorithm.	J. ACM	1988	DBLP DOI BibTeX RDF
27	Pierre Fraigniaud, Andrzej Pelc	Delays induce an exponential memory gap for rendezvous in trees.	SPAA	2010	DBLP DOI BibTeX RDF	mobile entities, robots, exploration, abstract state machine, rendezvous
27	Dmitry G. Korzun, Andrei V. Gurtov	A local equilibrium model for P2P resource ranking.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
27	Bill Lin 0001, Jun (Jim) Xu, Nan Hua, Hao Wang 0006, Haiquan (Chuck) Zhao	A randomized interleaved DRAM architecture for the maintenance of exact statistics counters.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
27	Sipat Triukose, Zhihua Wen, Michael Rabinovich	Content delivery networks: how big is big enough?	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
27	Alma Riska, Erik Riedel	Evaluation of disk-level workloads at different time scales.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
27	Ken-ichi Kawarabayashi, Bruce A. Reed	A nearly linear time algorithm for the half integral parity disjoint paths packing problem.	SODA	2009	DBLP DOI BibTeX RDF
27	Ke Yi 0001	Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes.	PODS	2009	DBLP DOI BibTeX RDF	lower bound, indexability, dynamization, range query
27	Tina Yu, Dave Wilkinson	A Co-Evolutionary Fuzzy System for Reservoir Well Logs Interpretation.	Evolutionary Computation in Practice	2008	DBLP DOI BibTeX RDF	reservoir modeling and characterization, co-operative co-evolution, well logs interpretation, fuzzy logic, genetic programming, time series
27	Elchanan Mossel, Allan Sly	Rapid mixing of Gibbs sampling on graphs that are sparse on average.	SODA	2008	DBLP BibTeX RDF	Erd?s-Rényi random graphs, Glauber dynamics, Gibbs samplers, mixing time, Ising model
27	Rina Panigrahy, Kunal Talwar, Udi Wieder	A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.	FOCS	2008	DBLP DOI BibTeX RDF
27	Zhifeng Yun, Sun Joseph Chang, Zhou Lei, Gabrielle Allen, Ashwin Bommathanahalli	Grid-enabled sawing optimization: from scanning images to cutting solution.	Mardi Gras Conference	2008	DBLP DOI BibTeX RDF
27	Xiongpai Qin, Yanqin Xiao, Wei Cao, Shan Wang 0001	A Parallel Recovery Scheme for Update Intensive Main Memory Database Systems.	PDCAT	2008	DBLP DOI BibTeX RDF
27	Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane	Compressed indexes for dynamic text collections.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Compressed suffix tree, string matching
27	Naveen Garg 0001, Amit Kumar 0001	Minimizing Average Flow-time : Upper and Lower Bounds.	FOCS	2007	DBLP DOI BibTeX RDF
27	Julia Chuzhoy, Joseph Naor	New hardness results for congestion minimization and machine scheduling.	J. ACM	2006	DBLP DOI BibTeX RDF	resource minimization, scheduling, network routing, Hardness of approximation, congestion minimization
27	David Liben-Nowell, Erik Vee, An Zhu	Finding longest increasing and common subsequences in streaming data.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Data-streaming model, Algorithms, Lower bounds, LCS, LIS
27	Ming-Yang Kao, Robert T. Schweller	Reducing tile complexity for self-assembly through temperature programming.	SODA	2006	DBLP DOI BibTeX RDF
27	Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu, Rajeev Rastogi, Anand Srinivasan	Efficient gossip-based aggregate computation.	PODS	2006	DBLP DOI BibTeX RDF
27	Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi	Integrality gaps for sparsest cut and minimum linear arrangement problems.	STOC	2006	DBLP DOI BibTeX RDF
27	Ittai Abraham, Yair Bartal, Ofer Neiman	Advances in metric embedding theory.	STOC	2006	DBLP DOI BibTeX RDF	metric embedding
27	Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel	Towards small world emergence.	SPAA	2006	DBLP DOI BibTeX RDF	bounded growth, distributed algorithms, routing algorithms, small world
27	Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong	Improved Approximate String Matching Using Compressed Suffix Data Structures.	ISAAC	2005	DBLP DOI BibTeX RDF
27	Marek Karpinski, Yakov Nekrich	Predecessor Queries in Constant Time?.	ESA	2005	DBLP DOI BibTeX RDF
27	Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee	Improved approximation algorithms for minimum-weight vertex separators.	STOC	2005	DBLP DOI BibTeX RDF	vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
27	Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram	Universal approximations for TSP, Steiner tree, and set cover.	STOC	2005	DBLP DOI BibTeX RDF	sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation
27	Sanjeev Arora, James R. Lee, Assaf Naor	Euclidean distortion and the sparsest cut.	STOC	2005	DBLP DOI BibTeX RDF	approximation algorithms, semidefinite programming, metric embeddings, sparsest cut
27	Andrej Bogdanov	Pseudorandom generators for low degree polynomials.	STOC	2005	DBLP DOI BibTeX RDF	derandomization, pseudorandomness
27	Jianyang Zeng 0001, Wen-Jing Hsu	ReCord: A Distributed Hash Table with Recursive Structure.	PDCAT	2005	DBLP DOI BibTeX RDF
27	Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor	Machine Minimization for Scheduling Jobs with Interval Constraints.	FOCS	2004	DBLP DOI BibTeX RDF
27	Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor	Measured Descent: A New Embedding Method for Finite Metrics.	FOCS	2004	DBLP DOI BibTeX RDF
27	Sun-Yuan Hsieh	Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
27	Julia Chuzhoy, Joseph Naor	New hardness results for congestion minimization and machine scheduling.	STOC	2004	DBLP DOI BibTeX RDF	routing, approximation algorithms, hardness of approximation, machine scheduling, congestion minimization
27	Harry Buhrman, Troy Lee, Dieter van Melkebeek	Language Compression and Pseudorandom Generators.	CCC	2004	DBLP DOI BibTeX RDF
27	Avrim Blum, Adam Kalai, Hal Wasserman	Noise-tolerant learning, the parity problem, and the statistical query model.	J. ACM	2003	DBLP DOI BibTeX RDF	machine learning, Computational learning theory, statistical queries
27	Yair Bartal, Manor Mendel	Multi-embedding and path approximation of metric spaces.	SODA	2003	DBLP BibTeX RDF
27	Ling Chen 0005, Yi Pan 0001	Faster Sorting on a Linear Array with a Reconfigurable Pipelined Bus System.	ISPA	2003	DBLP DOI BibTeX RDF
27	Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor	The online set cover problem.	STOC	2003	DBLP DOI BibTeX RDF	competitive analysis, on-line algorithms, set-cover, derandomization, randomized rounding
27	Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas	Optimal Solutions for the Temporal Precedence Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF
27	Ke Qiu 0002, Sajal K. Das 0001	A Novel Neighbourhood Broadcasting Algorithm on Star Graphs.	ICPADS	2002	DBLP DOI BibTeX RDF
27	James H. Anderson, Yong-Jik Kim	An improved lower bound for the time complexity of mutual exclusion.	PODC	2001	DBLP DOI BibTeX RDF
27	Shay Kutten, David Peleg	Deterministic distributed resource discovery (brief announcement).	PODC	2000	DBLP DOI BibTeX RDF
27	S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom	On an Optimal Split Tree Problem.	WADS	1999	DBLP DOI BibTeX RDF
27	Monika Rauch Henzinger, Michael L. Fredman	Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.	Algorithmica	1998	DBLP DOI BibTeX RDF	Dynamic planarity testing, Dynamic connectivity testing, Dynamic planarity testing, Dynamic connectivity testing, Lower bounds, Lower bounds, Key words, Cell probe model, Cell probe model
27	Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin	Approximating a Finite Metric by a Small Number of Tree Metrics.	FOCS	1998	DBLP DOI BibTeX RDF	probabilistic approximation of metric spaces, low diameter partitioning, real normed spaces, algorithms, linear programming, approximation, metric space, derandomization, tree metric
27	Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman	Performing Tasks on Restartable Message-Passing Processors.	WDAG	1997	DBLP DOI BibTeX RDF
27	Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara	A Parallel Algorithm for Weighted Distance Transforms.	IPPS	1997	DBLP DOI BibTeX RDF
27	Yoojin Chung, Kunsoo Park, Yookun Cho	Parallel Maximum Matching Algorithms in Interval Graphs.	ICPADS	1997	DBLP DOI BibTeX RDF
27	Eric Ruppert	Finding the k Shortest Paths in Parallel.	STACS	1997	DBLP DOI BibTeX RDF	Topics parallel algorithms, data structures
27	Stephan Olariu, Albert Y. Zomaya	A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	time-optimal algorithms, routing, parallel algorithms, VLSI, lower bounds, CAD, Circuit design
27	Lin Chen 0001	Optimal overlap representations.	ISPAN	1996	DBLP DOI BibTeX RDF	optimal overlap representations, minimal interval, circular arc overlap representations, minimal interval overlap representation, EREW PRAM processors, common CRCW PRAM, BSR processors, parallel algorithms, computational complexity, computational geometry, optimal algorithms
27	Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann	Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.	STACS	1995	DBLP DOI BibTeX RDF
27	Jingsen Chen	Parallel Heap Construction Using Multiple Selection.	CONPAR	1994	DBLP DOI BibTeX RDF	double-ended priority queues, multiple selection, parallel algorithms, Data structures, priority queues
27	Maria Cristina Pinotti, Geppino Pucci	Parallel Algorithms for Priority Queue Operations.	SWAT	1992	DBLP DOI BibTeX RDF	Parallel Algorithms, Data Structures, Analysis of Algorithms, Heaps
27	Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan	Faster Algorithms for the Shortest Path Problem	J. ACM	1990	DBLP DOI BibTeX RDF
27	Michel J. Daydé, Iain S. Duff	Use of parallel level 3 BLAS in LU factorization on three vector multiprocessors the ALLIANT FX/80, the CRAY-2, and the IBM 3090 VF.	ICS	1990	DBLP DOI BibTeX RDF
27	Lin Chen 0001	Efficient Deterministic Parallel Algorithms for Integer Sorting.	ICCI	1990	DBLP DOI BibTeX RDF	Resource Tradeoff, Parallel Computation, Lower Bound, Sorting, PRAM, Algorithm Design and Analysis, Prefix Sum, Lexicographic Order, NC
27	Mikhail J. Atallah	A Faster Parallel Algorithm for a Matrix Searching Problem.	SWAT	1990	DBLP DOI BibTeX RDF
27	Eli Upfal, Avi Wigderson	How to share memory in a distributed system.	J. ACM	1987	DBLP DOI BibTeX RDF
27	Sergio Duarte Torres, Djoerd Hiemstra, Pavel Serdyukov	Query log analysis in the context of information retrieval for children.	SIGIR	2010	DBLP DOI BibTeX RDF	query log analysis, query intent, query representation
27	Meiyappan Nagappan	Analysis of execution log files.	ICSE (2)	2010	DBLP DOI BibTeX RDF	analysis of textual data, diagnosis, fault isolation, log files
27	Yunjuan Cao, Xueping Peng, Kun Zhao, Zhendong Niu, Gx Xu, Weiqiang Wang	Query Expansion Based on Query Log and Small World Characteristic.	WISE	2009	DBLP DOI BibTeX RDF	small world characteristic, Query expansion, mutual information, query log analysis
27	Stéphane Clinchant, Éric Gaussier	Retrieval constraints and word frequency distributions: a log-logistic model for IR.	CIKM	2009	DBLP DOI BibTeX RDF	ir models, log-logistic, retrieval constraints, burstiness
27	Kyoko Yonezawa, Takashi Miyaki, Jun Rekimoto	Cat@Log: sensing device attachable to pet cats for supporting human-pet interaction.	Advances in Computer Entertainment Technology	2009	DBLP DOI BibTeX RDF	human-pet interaction, user interface, wearable computing, activity recognition, life log
27	Frank Comeau, Shyamala C. Sivakumar, William J. Phillips, William Robertson 0001	A Clustered Wireless Sensor Network Model Based on Log-Distance Path Loss.	CNSR	2008	DBLP DOI BibTeX RDF	clustered wireless sensor network, crossover distance, log-distance, WSN, compression, path loss
27	Victor Ariel Leal Sobral, Roberto Espinheira da Costa Bomfim, Robson Nunes de Lima, Ana Isabela Araújo Cunha	Systematic methodology for the design of Seevinck's CMOS log-domain integrators.	SBCCI	2008	DBLP DOI BibTeX RDF	CMOS integrators, companding circuits, log-domain integrators
27	Martin Jambor, Tomás Hrubý, Jan Taus, Kuba Krchak, Viliam Holub	Implementation of a Linux log-structured file system with a garbage collector.	ACM SIGOPS Oper. Syst. Rev.	2007	DBLP DOI BibTeX RDF	Linux file systems, garbage collection, log-structured file systems
27	Sylvain Fischer, Filip Sroubek, Laurent U. Perrinet, Rafael Redondo, Gabriel Cristóbal	Self-Invertible 2D Log-Gabor Wavelets.	Int. J. Comput. Vis.	2007	DBLP DOI BibTeX RDF	log-Gabor filters, oriented high-pass filters, wavelet transforms, image denoising, visual system
27	Chen (Cherie) Ding, Jin Zhou	Log-based indexing to improve web site search.	SAC	2007	DBLP DOI BibTeX RDF	log-based indexing, term propagation, web site search
27	Chen Li 0006, Jiayin Qi, Huaying Shu	A HowNet Based Web Log Mining Algorithm.	CONFENIS (2)	2007	DBLP DOI BibTeX RDF	User navigation patterns, Web log mining, HowNet
27	Jeffrey Xu Yu, Yuming Ou, Chengqi Zhang, Shichao Zhang 0001	Identifying Interesting Customers through Web Log Classification.	IEEE Intell. Syst.	2005	DBLP DOI BibTeX RDF	customer retention, recommendation system, Web mining, data preparation, web log analysis
27	Roland Schegg, Thomas Steiner, Thouraya Gherissi-Labben, Jamie Murphy	Using Log File Analysis and Website Assessment to Improve Hospitality Websites.	ENTER	2005	DBLP DOI BibTeX RDF	Hotel web sites, customer focus, click path maps, HTTP, log file analysis, URL
27	David Jao, Stephen D. Miller, Ramarathnam Venkatesan	Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?	ASIACRYPT	2005	DBLP DOI BibTeX RDF	random reducibility, modular forms, L-functions, generalized Riemann hypothesis, elliptic curves, expanders, Ramanujan graphs, isogenies, rapid mixing, discrete log
27	Hui Dai, Michael Neufeld, Richard Han 0001	ELF: an efficient log-structured flash file system for micro sensor nodes.	SenSys	2004	DBLP DOI BibTeX RDF	eeprom, log structured, reliability, sensor, file system, flash
27	Bin Yu 0010, Wei-Ying Ma, Klara Nahrstedt, HongJiang Zhang	Video summarization based on user log enhanced link analysis.	ACM Multimedia	2003	DBLP DOI BibTeX RDF	link analysis, video summarization, user behavior, video content analysis, log mining, skimming
27	Adam L. Young, Moti Yung	The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems.	CRYPTO	1997	DBLP DOI BibTeX RDF	DSA signature, Menezes-Vanstone PKCS, Schnorr signature algorithm, protocol abuse, leakage-bandwidth, cryptographic system implementations, randomness, pseudorandomness, Diffie-Hellman, subliminal channels, kleptography, setup, ElGamal encryption, ElGamal signature, Discrete-Log
27	Jai Menon 0001	A Performance Comparison of RAID-5 and Log-Structured Arrays.	HPDC	1995	DBLP DOI BibTeX RDF	RAID-5, log-structured arrays, transaction-processing workloads, outboard disk controller, nonvolatile cache, physical disks, storage management, cache storage, performance comparison, compression ratio
26	James Cook, Ian Mertz	Tree Evaluation is in Space O(log n · log log n).	Electron. Colloquium Comput. Complex.	2023	DBLP BibTeX RDF
26	Dyllan Cartwright, Radu Andrei Sterie, Arash Yadegari Ghahderijani, Dimka Karastoyanova	Adaptive Process Log Generation and Analysis with Next(Log) and ML.Log.	EDOC Workshops	2023	DBLP DOI BibTeX RDF
26	Giuseppe Carlo Calafiore, Stephane Gaubert, Corrado Possieri	Log-Sum-Exp Neural Networks and Posynomial Models for Convex and Log-Log-Convex Data.	IEEE Trans. Neural Networks Learn. Syst.	2020	DBLP DOI BibTeX RDF
26	Giuseppe Carlo Calafiore, Stephane Gaubert, Corrado Possieri	Log-sum-exp neural networks and posynomial models for convex and log-log-convex data.	CoRR	2018	DBLP BibTeX RDF
26	Jason Tyler King, Jonathan Stallings, Maria Riaz, Laurie A. Williams	To log, or not to log: using heuristics to identify mandatory log events - a controlled experiment.	Empir. Softw. Eng.	2017	DBLP DOI BibTeX RDF
26	Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi	An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem.	Oper. Res.	2017	DBLP DOI BibTeX RDF
26	Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman	A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds.	J. ACM	2017	DBLP DOI BibTeX RDF
26	Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie	Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time.	SODA	2017	DBLP DOI BibTeX RDF
26	Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie	Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time.	CoRR	2016	DBLP BibTeX RDF
26	Amitabha Chakrabarty, Martin Collier	O(log m. log N) routing algorithm for (2 log N-1)-stage switching networks and beyond.	J. Parallel Distributed Comput.	2014	DBLP DOI BibTeX RDF
26	Sriram V. Pemmaraju, Vivek B. Sardeshmukh	Minimum-weight Spanning Tree Construction in $O(\log \log \log n)$ Rounds on the Congested Clique.	CoRR	2014	DBLP BibTeX RDF