Search results for "log"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
26	Thomas Rothvoß	Approximating Bin Packing within O(log OPT * log log OPT) bins	CoRR	2013	DBLP BibTeX RDF
26	Thomas Rothvoß	Approximating Bin Packing within O(log OPT * Log Log OPT) Bins.	FOCS	2013	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.	SODA	2010	DBLP DOI BibTeX RDF
26	Jian Li 0015	An O(log(n)/log(log(n))) upper bound on the price of stability for undirected Shapley network design games.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
26	Shay Mozes, Christian Wulff-Nilsen	Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time	CoRR	2009	DBLP BibTeX RDF
26	Jian Li 0015	An O(log n / log log n}) Upper Bound on the Price of Stability for Undirected Shapley Network Design Games	CoRR	2008	DBLP BibTeX RDF
26	Vladimir Trifonov	An O(log n log log n) Space Algorithm for Undirected s,t-Connectivity	Electron. Colloquium Comput. Complex.	2004	DBLP BibTeX RDF
26	Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup	Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient.	FOCS	1996	DBLP DOI BibTeX RDF
26	Ka Wong Chong, Tak Wah Lam	Finding Connected Components in O(log n log log n) Time on the EREW PRAM.	J. Algorithms	1995	DBLP DOI BibTeX RDF
26	Sung-Ryul Kim, Kunsoo Park, Yookun Cho	An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem.	ISPAN	1994	DBLP DOI BibTeX RDF
26	Ka Wong Chong, Tak Wah Lam	Finding Connected Components in O(log n log log n) Time on the EREW PRAM.	SODA	1993	DBLP DOI BibTeX RDF
26	Andrzej Szepietowski	If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n.	Theor. Comput. Sci.	1990	DBLP DOI BibTeX RDF
26	Andrzej Szepietowski	A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL].	Bull. EATCS	1990	DBLP BibTeX RDF
26	Wei-Kuan Shih, Wen-Lian Hsu	An O(n log n+m log log n) Maximum Weight Clique Algorithm for Circular-Arc Graphs.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
26	Taenam Kim, Kyung-Yong Chwa	An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF
26	Andrzej Szepietowski	There are no Fully Space Constructible Functions Between log log n and log n.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF
26	Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc	How to meet when you forget: log-space rendezvous in arbitrary graphs.	PODC	2010	DBLP DOI BibTeX RDF	exploration, rendezvous, compact data structure
26	R. Kelley Pace, James Paul LeSage	A sampling approach to estimate the log determinant used in spatial likelihood problems.	J. Geogr. Syst.	2009	DBLP DOI BibTeX RDF	JEL Classfication C11, C23, C21, R11
26	Chu-Hsing Lin, Jung-Chun Liu, Ching-Ru Chen	Access Log Generator for Analyzing Malicious Website Browsing Behaviors.	IAS	2009	DBLP DOI BibTeX RDF
26	Holger Boche, Martin Schubert	A Calculus for Log-Convex Interference Functions.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
26	Umer Salim, Dirk T. M. Slock	MIMO capacity pre-log for flat fading stationary channels with no CSIR.	PIMRC	2008	DBLP DOI BibTeX RDF
26	Chinghway Lim, Navjot Singh 0001, Shalini Yajnik	A log mining approach to failure analysis of enterprise telephony systems.	DSN	2008	DBLP DOI BibTeX RDF
26	Xi Li 0001, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang 0002, Mingliang Zhu, Jian Cheng 0002	Visual tracking via incremental Log-Euclidean Riemannian subspace learning.	CVPR	2008	DBLP DOI BibTeX RDF
26	Tom Vercauteren, Xavier Pennec, Aymeric Perchant, Nicholas Ayache	Symmetric Log-Domain Diffeomorphic Registration: A Demons-Based Approach.	MICCAI (1)	2008	DBLP DOI BibTeX RDF
26	Seyed Mehdi Lajevardi, Margaret Lech	Facial Expression Recognition Using Neural Networks and Log-Gabor Filters.	DICTA	2008	DBLP DOI BibTeX RDF
26	Carlo Fischione, Fabio Graziosi, Fortunato Santucci	Approximation for a Sum of On-Off Log-Normal Processes With Wireless Applications.	IEEE Trans. Commun.	2007	DBLP DOI BibTeX RDF
26	Jussi T. Lindgren, Jarmo Hurri, Aapo Hyvärinen	The Statistical Properties of Local Log-Contrast in Natural Images.	SCIA	2007	DBLP DOI BibTeX RDF
26	Haiping Wu, Hongliang Yu, Bigang Li, Wei Xue, Weimin Zheng	A Database Redo Log System Based on Virtual Memory Disk.	International Conference on Computational Science (3)	2006	DBLP DOI BibTeX RDF
26	Young-Ho Son, Bum-Jae You, Sang-Rok Oh, Gwi-Tae Park	Affine-Invariant Pattern Recognition using Momentums in Log-Polar Images.	FGR	2004	DBLP DOI BibTeX RDF
26	Michael Minock, Hansi Kraus	Z-log: Applying System-Z.	JELIA	2002	DBLP DOI BibTeX RDF
26	David B. Lomet	High Speed On-line Backup When Using Logical Log Operations.	SIGMOD Conference	2000	DBLP DOI BibTeX RDF
26	James H. Andrews, Yingjun Zhang	Broad-spectrum studies of log file analysis.	ICSE	2000	DBLP DOI BibTeX RDF	testing, specification, test oracles, lightweight formal methods, safety verification
26	Ioan I. Macarie	On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract).	STACS	1995	DBLP DOI BibTeX RDF
26	Klaus Kriegel	The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus.	MFCS	1986	DBLP DOI BibTeX RDF
26	Tetsuji Takada, Hideki Koike	NIGELOG: Protecting Logging Information by Hiding Multiple Backups in Directories.	DEXA Workshops	1999	DBLP DOI BibTeX RDF	log information protection methods, restorable lost log information, hiding backups
26	John H. Hartman, John K. Ousterhout	The Zebra Striped Network File System	ACM Trans. Comput. Syst.	1995	DBLP DOI BibTeX RDF	log-based striping, parity computation, RAID, log-structured file system
25	Akihiro Tomono, Minoru Uehara, Yuji Shimada	Transferring trusted logs across vulnerable paths for digital forensics.	MoMM	2009	DBLP DOI BibTeX RDF	log management, digital forensics, internal control
25	Daisuke Mashima, Mustaque Ahamad	Using identity credential usage logs to detect anomalous service accesses.	Digital Identity Management	2009	DBLP DOI BibTeX RDF	identity theft and misuse detection, online access log monitoring, risk scoring
25	Harksoo Kim, Jungyun Seo	Cluster-Based FAQ Retrieval Using Latent Term Weights.	IEEE Intell. Syst.	2008	DBLP DOI BibTeX RDF	lexical disagreement problem, query log clustering, FAQ smoothing, cluster-based FAQ retrieval, latent semantic analysis
25	Nayot Poolsapassit, Indrajit Ray	Investigating Computer Attacks Using Attack Trees. (PDF / PS)	IFIP Int. Conf. Digital Forensics	2007	DBLP DOI BibTeX RDF	Forensic investigation, computer attacks, log file filtering, attack tree
25	Vijay N. V. Kallepalli, Sylvanus A. Ehikioya, Sergio Camorlinga, Jose A. Rueda	Security Middleware Infrastructure for DICOM Images in Health Information Systems.	J. Digit. Imaging	2003	DBLP DOI BibTeX RDF	log maintenance, PHIA, security, privacy, access control, middleware, confidentiality, infrastructure, health care, DICOM, policy management
25	Nam Ling, Rajesh Advani	Architecture of a fast motion estimator for MPEG video coding.	ISPAN	1996	DBLP DOI BibTeX RDF	fast motion estimator, MPEG video coding, 2-D log search, MPEG2 video, motion estimation, motion estimator, video coding, systolic arrays, motion vector, Verilog, Synopsys
24	Timothy M. Chan	Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry.	FOCS	2006	DBLP DOI BibTeX RDF
24	Peter Krusche, Alexander Tiskin	New algorithms for efficient parallel string comparison.	SPAA	2010	DBLP DOI BibTeX RDF	BSP algorithms, longest increasing subsequences, longest common subsequences
24	Uriel Feige, Kunal Talwar	Approximating the Bandwidth of Caterpillars.	Algorithmica	2009	DBLP DOI BibTeX RDF
24	Parinya Chalermsook, Julia Chuzhoy	Maximum independent set of rectangles.	SODA	2009	DBLP DOI BibTeX RDF
24	James Aspnes, Hagit Attiya, Keren Censor	Max registers, counters, and monotone circuits.	PODC	2009	DBLP DOI BibTeX RDF	max registers, distributed computing, shared memory, counters, monotone circuits
24	Harald Räcke, Adi Rosén	Approximation algorithms for time-constrained scheduling on line networks.	SPAA	2009	DBLP DOI BibTeX RDF	line networks, time constraints, packet scheduling
24	Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong	Improved Approximate String Matching Using Compressed Suffix Data Structures.	Algorithmica	2008	DBLP DOI BibTeX RDF
24	Benjamin Doerr, Tobias Friedrich 0001, Thomas Sauerwald	Quasirandom rumor spreading.	SODA	2008	DBLP BibTeX RDF
24	Guy E. Blelloch	Space-efficient dynamic orthogonal point location, segment intersection, and range reporting.	SODA	2008	DBLP BibTeX RDF
24	Zheng Wang 0006, Hamid R. Sadjadpour, J. J. Garcia-Luna-Aceves	A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
24	Anindya De, Piyush P. Kurur, Chandan Saha 0001, Ramprasad Saptharishi	Fast integer multiplication using modular arithmetic.	STOC	2008	DBLP DOI BibTeX RDF	computational algebra, modular arithmetic, integer multiplication
24	Svante Janson, Wojciech Szpankowski	Partial fillup and search time in LC tries.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization
24	Lei Ying 0001, R. Srikant 0001, Geir E. Dullerud	Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
24	Milan Ruzic	Making deterministic signatures quickly.	SODA	2007	DBLP BibTeX RDF
24	Moses Charikar, Konstantin Makarychev, Yury Makarychev	Local Global Tradeoffs in Metric Embeddings.	FOCS	2007	DBLP DOI BibTeX RDF
24	Subhash Khot, Assaf Naor	Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.	FOCS	2007	DBLP DOI BibTeX RDF
24	Martin Fürer	Faster integer multiplication.	STOC	2007	DBLP DOI BibTeX RDF	complexity, FFT, computer arithmetic, discrete Fourier transform, integer multiplication
24	Petra Berenbrink, Colin Cooper, Zengjian Hu	Energy efficient randomised communication in unknown AdHoc networks.	SPAA	2007	DBLP DOI BibTeX RDF	ad hoc networks, energy efficiency, broadcasting, randomized algorithms, gossiping
24	Veli Mäkinen, Gonzalo Navarro 0001	Dynamic Entropy-Compressed Sequences and Full-Text Indexes.	CPM	2006	DBLP DOI BibTeX RDF
24	Ankur Gupta 0003, Wing-Kai Hon, Rahul Shah 0001, Jeffrey Scott Vitter	Compressed Data Structures: Dictionaries and Data-Aware Measures.	DCC	2006	DBLP DOI BibTeX RDF
24	Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani	On earthmover distance, metric labeling, and 0-extension.	STOC	2006	DBLP DOI BibTeX RDF
24	Julia Chuzhoy, Sanjeev Khanna	Hardness of cut problems in directed graphs.	STOC	2006	DBLP DOI BibTeX RDF	directed multicut, hardness of approximation, sparsest cut
24	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-time tradeoffs for approximate spherical range counting.	SODA	2005	DBLP BibTeX RDF
24	Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane	Dynamic dictionary matching and compressed suffix trees.	SODA	2005	DBLP BibTeX RDF
24	Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor	A general approach to online network optimization problems.	SODA	2004	DBLP BibTeX RDF
24	Pankaj K. Agarwal, Yusu Wang 0001, Hai Yu 0005	A 2D kinetic triangulation with near-quadratic topological changes.	SCG	2004	DBLP DOI BibTeX RDF	triangulation, random sampling, kinetic data structures
24	Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang	Construction of the Nearest Neighbor Embracing Graph of a Point Set.	SWAT	2004	DBLP DOI BibTeX RDF
24	Eli Ben-Sasson, Oded Goldreich 0001, Prahladh Harsha, Madhu Sudan 0001, Salil P. Vadhan	Robust pcps of proximity, shorter pcps and applications to coding.	STOC	2004	DBLP DOI BibTeX RDF	property testing, probabilistically checkable proofs, PCP, locally decodable codes, locally testable codes
24	Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001	The Complexity of the Covering Radius Problem on Lattices and Codes.	CCC	2004	DBLP DOI BibTeX RDF
24	Phong Q. Nguyen, Igor E. Shparlinski	The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces.	Des. Codes Cryptogr.	2003	DBLP DOI BibTeX RDF	cryptanalysis, distribution, lattices, elliptic curves, discrepancy, exponential sums, ECDSA, LLL, closest vector problem
24	Shay Kutten, David Peleg, Uzi Vishkin	Deterministic Resource Discovery in Distributed Networks.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
24	Satyanarayana V. Lokam	Graph Complexity and Slice Functions.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
24	Elango Ganesan, Dhiraj K. Pradhan	Wormhole routing in de Bruijn networks and hyper-de Bruijn networks.	ISCAS (3)	2003	DBLP DOI BibTeX RDF
24	Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani	A stochastic process on the hypercube with applications to peer-to-peer networks.	STOC	2003	DBLP DOI BibTeX RDF	coupon collector, peer to peer, load balancing, hypercube, hash table
24	James H. Anderson, Yong-Jik Kim	Nonatomic mutual exclusion with local spinning.	PODC	2002	DBLP DOI BibTeX RDF
24	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-efficient approximate Voronoi diagrams.	STOC	2002	DBLP DOI BibTeX RDF
24	Juchang Lee, Kihong Kim, Sang Kyun Cha	Differential Logging: A Commutative and Associative Logging Scheme for Highly Parallel Main Memory Databases.	ICDE	2001	DBLP DOI BibTeX RDF
24	Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri	Distributed multi-broadcast in unknown radio networks.	PODC	2001	DBLP DOI BibTeX RDF
24	G. Sajith, Sanjeev Saxena	Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.	Algorithmica	2000	DBLP DOI BibTeX RDF	CRCW model, Tree colouring, Parallel algorithms, Optimal algorithms, Maximal independent set
24	Alan A. Bertossi, Alessandro Mei	A Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	string matching with $k$ mismatches, VLSI, residue number system, reconfigurable mesh, prefix sums, Number representation
24	Kunihiko Sadakane	Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array.	ISAAC	2000	DBLP DOI BibTeX RDF
24	Michael Elkin, David Peleg	Strong Inapproximability of the Basic k-Spanner Problem.	ICALP	2000	DBLP DOI BibTeX RDF
24	Sergio De Agostino	Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW.	SPIRE	2000	DBLP DOI BibTeX RDF	LZ compressed text, PRAM EREW, sliding window compression, LZ2 compression method, LZ1 compression, output string, next character heuristic, identity heuristic, data compression, dictionary, text compression, P-complete, parallel decoding
24	Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos	Linear Hash Functions.	J. ACM	1999	DBLP DOI BibTeX RDF	hashing via linear maps, universal hashing
24	Sorin Cotofana, Stamatis Vassiliadis	Periodic symmetric functions, serial addition, and multiplication with neural networks.	IEEE Trans. Neural Networks	1998	DBLP DOI BibTeX RDF
24	Ka Wong Chong, Edgar A. Ramos	Improved Deterministic Parallel Padded Sorting.	ESA	1998	DBLP DOI BibTeX RDF
24	Eli Upfal, Sergio A. Felperin, Marc Snir	Randomized Routing with Shorter Paths.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	interconnection networks, packet-switching, multistage networks, randomized routing, Butterfly networks, parallel communication
24	Anil Maheshwari, Andrzej Lingas	A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree.	STACS	1994	DBLP DOI BibTeX RDF
24	Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg	Tolerating Faults in Synchronization Networks.	CONPAR	1992	DBLP DOI BibTeX RDF
24	Artur Czumaj	An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications.	SWAT	1992	DBLP DOI BibTeX RDF
24	Kuo-Liang Chung, Ferng-Ching Lin, Wen-Chin Chen	Cost-optimal parallel B-spline interpolations.	ICS	1990	DBLP DOI BibTeX RDF
24	Joseph Friedman, John Hershberger 0001, Jack Snoeyink	Input-Sensitive Compliant Motion in the Plane.	SWAT	1990	DBLP DOI BibTeX RDF
24	Dean S. Daniels, Alfred Z. Spector, Dean S. Thompson	Distributed Logging for Transaction Processing.	SIGMOD Conference	1987	DBLP DOI BibTeX RDF
24	Victor Y. Pan	Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices.	FSTTCS	1985	DBLP DOI BibTeX RDF	characteristic polynomial of a matrix, Parallel algorithms, computational complexity, determinant, matrix inversion, systems of linear equations
24	Gaston H. Gonnet, J. Ian Munro	Heaps on Heaps.	ICALP	1982	DBLP DOI BibTeX RDF
24	Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg	Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version).	ICALP	1981	DBLP DOI BibTeX RDF
23	Marco Di Renzo, Laura Imbriglio, Fabio Graziosi, Fortunato Santucci	Cooperative spectrum sensing for cognitive radio networks with amplify and forward relaying over correlated log-normal shadowing.	MobiHoc	2009	DBLP DOI BibTeX RDF	amplify and forward relying, cooperative spectrum sensing, correlated log-normal shadowing, cognitive radio
23	Ammy Jiranida Phuwanartnurak, David G. Hendry	Understanding information sharing in software development through Wiki log analysis.	Int. Sym. Wikis	2009	DBLP DOI BibTeX RDF	Wiki log, Wiki, information sharing, interdisciplinary design