|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11271 occurrences of 4499 keywords
|
|
|
Results
Found 44970 publication records. Showing 44968 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
96 | Krishnaram Kenthapadi, Rina Panigrahy |
Balanced allocation on graphs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
89 | Guy Even, Guy Kortsarz |
An approximation algorithm for the group Steiner problem. |
SODA |
2002 |
DBLP BibTeX RDF |
|
83 | Dimitris Fotakis 0001, Paul G. Spirakis |
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. |
MFCS |
1996 |
DBLP DOI BibTeX RDF |
|
79 | Sajal K. Das 0001, Maria Cristina Pinotti, Falguni Sarkar |
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes. |
IEEE Trans. Parallel Distributed Syst. |
1996 |
DBLP DOI BibTeX RDF |
slope-tree, b-bandwidth slope-heap, load balance, hypercube, priority queue, Hamiltonian path, heap, speed-up |
69 | Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen |
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. |
SCG |
2010 |
DBLP DOI BibTeX RDF |
orthogonal range reporting, pointer machine, data structures, lower bounds |
69 | Yijie Han |
Fast Integer Sorting in Linear Space. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
65 | Veli Mäkinen, Gonzalo Navarro 0001 |
Dynamic entropy-compressed sequences and full-text indexes. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Compressed dynamic data structures, compressed text databases, partial sums, entropy, sequences |
65 | Mikkel Thorup |
Equivalence between priority queues and sorting. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
sorting, Priority queues |
65 | Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann |
Shared Memory Simulations with Triple-Logarithmic Delay. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
62 | Tatsuya Hayashi, Koji Nakano, Stephan Olariu |
Optimal Parallel Algorithms for Finding Proximate Points, with Applications. |
IEEE Trans. Parallel Distributed Syst. |
1998 |
DBLP DOI BibTeX RDF |
Proximate points, largest empty circles, pattern recognition, parallel algorithms, image analysis, convex hulls, digital geometry, cellular systems |
58 | Chengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator |
O(log log n)-competitive dynamic binary search trees. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
58 | Chi-Jen Lu |
Improved Pseudorandom Generators for Combinatorial Rectangles. |
Comb. |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05B40, 68Q25, 68R05 |
57 | Gianni Franceschini, Roberto Grossi |
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. |
SODA |
2003 |
DBLP BibTeX RDF |
|
57 | Zhiqian Wang, Jezekiel Ben-Arie |
SVD and log-log frequency sampling with Gabor kernels for invariant pictorial recognition. |
ICIP (3) |
1997 |
DBLP DOI BibTeX RDF |
log-log frequency sampling, Gabor kernels, invariant pictorial recognition, affine-invariant object recognition, signature recognition, sampling configuration, affine transform decomposition, slant, 2D translation, affine invariant spectral signatures, Cartesian logarithmic-logarithmic configuration, image patches, planar object surfaces, global Fourier transform, local Gabor transform, local representation, 3D pose information, singular value decomposition, singular value decomposition, SVD, scale, frequency domain, tilt, swing, multi-dimensional indexing |
55 | Arne Andersson, Mikkel Thorup |
Dynamic ordered sets with exponential search trees. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
ordered lists, Search trees |
53 | Danny Hendler, Philipp Woelfel |
Randomized mutual exclusion in O(log N / log log N) RMRs. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
remote memory references (RMRS), mutual exclusion |
52 | Nabil Hammoud |
Decentralized log event correlation architecture. |
MEDES |
2009 |
DBLP DOI BibTeX RDF |
activity logging, distributed logs, log event correlation, log event management systems, log analysis |
52 | Tatsuya Hayashi, Koji Nakano, Stephan Olariu |
An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes. |
IEEE Trans. Parallel Distributed Syst. |
1998 |
DBLP DOI BibTeX RDF |
pattern recognition, mobile computing, image processing, Convex hulls, morphology, reconfigurable meshes |
51 | Yakov Nekrich |
Space efficient dynamic orthogonal range reporting. |
SCG |
2005 |
DBLP DOI BibTeX RDF |
computational geometry, dynamic data structures, algorithms and data structures, orthogonal range searching |
51 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee |
Time-space trade-off lower bounds for randomized computation of decision problems. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
element distinctness, Branching programs, quadratic forms, random-access machines |
51 | Koji Nakano, Stephan Olariu |
Randomized Leader Election Protocols in Radio Networks with No Collision Detection. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
51 | Yu-Hua Lee, Shi-Jinn Horng |
Fast parallel chessboard distance transform algorithms. |
ICPADS |
1996 |
DBLP DOI BibTeX RDF |
fast parallel chessboard distance transform algorithms, diagonal propagation approach, O(N2) time sequential algorithm, 2-D binary image array, parallel algorithms, computational complexity, image processing, computational geometry, hypercube networks, medial axis transform, EREW PRAM model, hypercube computer, CRCW PRAM model |
51 | Mi Lu, Hua Lin |
Parallel Algorithms for the Longest Common Subsequence Problem. |
IEEE Trans. Parallel Distributed Syst. |
1994 |
DBLP DOI BibTeX RDF |
longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound |
51 | Shiva Chaudhuri, Torben Hagerup, Rajeev Raman |
Approximate and Exact Deterministic Parallel Selection. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
51 | Yossi Shiloach, Uzi Vishkin |
Finding the maximum, merging and sorting in a parallel computation model. |
CONPAR |
1981 |
DBLP DOI BibTeX RDF |
|
51 | Steven C. H. Hoi, Michael R. Lyu, Rong Jin 0001 |
A Unified Log-Based Relevance Feedback Scheme for Image Retrieval. |
IEEE Trans. Knowl. Data Eng. |
2006 |
DBLP DOI BibTeX RDF |
log-based relevance feedback, log data, user issues, support vector machines, relevance feedback, Content-based image retrieval, semantic gap |
51 | Daxin Jiang, Jian Pei, Hang Li |
Search and browse log mining for web information retrieval: challenges, methods, and applications. |
SIGIR |
2010 |
DBLP DOI BibTeX RDF |
log data mining, search and browse logs |
50 | Andrzej Szepietowski |
If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n. (journal version: Theor. Comput. Sci. 74(1): 115-119(1990)) |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
50 | Vinod Viswanath |
Multi-log Processor - Towards Scalable Event-Driven Multiprocessors. |
DSD |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Marco Di Renzo, Fabio Graziosi, Fortunato Santucci |
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribution. |
VTC Spring |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott 0001 |
Improved approximations for multiprocessor scheduling under uncertainty. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
scheduling under uncertainty, approximation algorithms, multiprocessor scheduling, stochastic scheduling |
48 | Michael Elkin, Guy Kortsarz |
Sublogarithmic approximation for telephone multicast: path out of jungle. |
SODA |
2003 |
DBLP BibTeX RDF |
|
48 | Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik |
Computational power of pipelined memory hierarchies. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
48 | Ravidutta Kodre, Hadar Ziv, Debra J. Richardson |
Statistical Sampling Based Approach to Alleviate Log Replay Testing. |
ICST |
2008 |
DBLP DOI BibTeX RDF |
Coupon Collector, Log Replay testing, Sampling in Log replay testing |
47 | Daxin Jiang, Jian Pei, Hang Li |
Web search/browse log mining: challenges, methods, and applications. |
WWW |
2010 |
DBLP DOI BibTeX RDF |
search and advertisement applications, search and browse logs, log mining |
47 | Sang-Won Lee 0001, Dong-Joo Park, Tae-Sun Chung, Dong-Ho Lee, Sangwon Park, Ha-Joo Song |
A log buffer-based flash translation layer using fully-associative sector translation. |
ACM Trans. Embed. Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
associative mapping, log blocks, Flash memory, address translation, FTL |
46 | Christian Schwarz 0002, Michiel H. M. Smid |
An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. |
SODA |
1992 |
DBLP BibTeX RDF |
|
46 | Barry W. Brown, Lawrence B. Levy, James Lovato, Kathy Russell, Floyd M. Spears |
Algorithm 762: LLDRLF, log-Likelihood and Some Derivatives for log-F Models. |
ACM Trans. Math. Softw. |
1996 |
DBLP DOI BibTeX RDF |
accelerated failure, log-F distribution, log-likelihood, FORTRAN |
45 | Yijie Han, Mikkel Thorup |
Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
45 | Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas |
Efficient processing of 3-sided range queries with probabilistic guarantees. |
ICDT |
2010 |
DBLP DOI BibTeX RDF |
3-sided range queries, probabilistic guarantees, amortized complexity |
45 | Kasturi R. Varadarajan |
Epsilon nets and union complexity. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, set cover, epsilon nets |
45 | Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson |
Cache-oblivious streaming B-trees. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
buffered repository tree, cache-oblivious B-tree, cascading array, deamortized, lookahead array, shuttle tree |
45 | Gurmeet Singh Manku, Moni Naor, Udi Wieder |
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
random structures, peer to peer networks, greedy routing |
45 | Weifa Liang, Richard P. Brent, Hong Shen |
Fully Dynamic Maintenance of k-Connectivity in Parallel. |
IEEE Trans. Parallel Distributed Syst. |
2001 |
DBLP DOI BibTeX RDF |
2-edge/vertex connectivity, 3-edge/vertex connectivity, parallel algorithm design and analysis, dynamic data structures, graph problems, NC algorithms |
45 | Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi 0001, Adi Rosén |
On Capital Investment. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
On-line financial problems, On-line algorithms, Competitive ratio |
45 | Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. |
PARLE |
1993 |
DBLP DOI BibTeX RDF |
|
45 | Kurt Mehlhorn |
Pebbling Moutain Ranges and its Application of DCFL-Recognition. |
ICALP |
1980 |
DBLP DOI BibTeX RDF |
|
44 | Vikram R. Pesati, Thomas E. Keefe, Shankar Pal |
The Design and Implementation of a Multilevel Secure Log Manager. |
S&P |
1997 |
DBLP DOI BibTeX RDF |
data loggers, multilevel secure log manager, log management, flush latency, performance, system design, bandwidth, system implementation, security evaluation, multilevel secure database system |
44 | Mendel Rosenblum, John K. Ousterhout |
The Design and Implementation of a Log-Structured File System. |
ACM Trans. Comput. Syst. |
1992 |
DBLP DOI BibTeX RDF |
disk storage management, fast crash recovery, file system organization, file system performance, high write performance, log-structured, Unix, logging |
43 | Zeev Nutov |
An almost O(log k)-approximation for k-connected subgraphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam |
Improved Bounds on Security Reductions for Discrete Log Based Signatures. |
CRYPTO |
2008 |
DBLP DOI BibTeX RDF |
Schnorr Signature Scheme, Provable Security, Random Oracle Model |
41 | Claudi Paniagua, Fatos Xhafa, Thanasis Daradoumis |
Gridifying IBM's Generic Log Adapter to Speed-Up the Processing of Log Data. |
CISIS |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Arne Andersson, Christer Mattsson |
Dynamic Interpolation Search in o(log log n) Time. |
ICALP |
1993 |
DBLP DOI BibTeX RDF |
|
41 | T.-H. Hubert Chan, Anupam Gupta 0001, Kunal Talwar |
Ultra-low-dimensional embeddings for doubling metrics. |
SODA |
2008 |
DBLP BibTeX RDF |
|
41 | Kunihiko Sadakane, Roberto Grossi |
Squeezing succinct data structures into entropy bounds. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao |
l22 spreading metrics for vertex ordering problems. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang |
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
41 | Tatsuya Hayashi, Koji Nakano, Stephan Olariu |
Work-Time Optimal k-Merge Algorithms on the PRAM. |
IEEE Trans. Parallel Distributed Syst. |
1998 |
DBLP DOI BibTeX RDF |
work-time optimal algorithms, information retrieval, parallel algorithms, databases, query processing, sorting, Merging |
41 | Seunghwan Lee, Geehyuk Lee, Hojin Kim |
Ubigraphy: a third-person viewpoint life log. |
CHI Extended Abstracts |
2008 |
DBLP DOI BibTeX RDF |
proximal interaction, third-person viewpoint life-log, ubiquitous computing, wearable computer, life-log |
41 | Chi Log Chua, Tong Ming Lim, Kwee Teck See |
An Overview of Part-of-Speech Tagging Methods and Datasets for Malay Language. |
ICSECS |
2023 |
DBLP DOI BibTeX RDF |
|
41 | Ruben Dobler Strand, Sindre Stokkenes, Lars Michael Kristensen, Torgrim Log |
Fire Risk Prediction Using Cloud-based Weather Data Services. |
J. Ubiquitous Syst. Pervasive Networks |
2022 |
DBLP DOI BibTeX RDF |
|
41 | Sindre Stokkenes, Ruben Dobler Strand, Lars Michael Kristensen, Torgrim Log |
Validation of a Predictive Fire Risk Indication Model using Cloud-based Weather Data Services. |
ANT/EDI40 |
2021 |
DBLP DOI BibTeX RDF |
|
41 | Torgrim Log |
Modeling Indoor Relative Humidity and Wood Moisture Content as a Proxy for Wooden Home Fire Risk. |
Sensors |
2019 |
DBLP DOI BibTeX RDF |
|
41 | Lars Michael Kristensen, Torgrim Log, Sindre Stokkenes |
Cloud-based Implementation and Validation of a Predictive Fire Risk Indication Model. |
NIK |
2019 |
DBLP BibTeX RDF |
|
41 | Torgrim Log |
Consumer Grade Weather Stations for Wooden Structure Fire Risk Assessment. |
Sensors |
2018 |
DBLP DOI BibTeX RDF |
|
41 | Sanjay Kumar Khattri, Torgrim Log |
Erratum to: Derivative free algorithm for solving nonlinear equations. |
Computing |
2013 |
DBLP DOI BibTeX RDF |
|
41 | Sanjay Kumar Khattri, Torgrim Log |
Constructing third-order derivative-free iterative methods. |
Int. J. Comput. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Sanjay Kumar Khattri, Torgrim Log |
Derivative free algorithm for solving nonlinear equations. |
Computing |
2011 |
DBLP DOI BibTeX RDF |
|
40 | Ig-Jae Kim, Sang Chul Ahn, Hyoung-Gon Kim |
Personalized Life Log Media System in Ubiquitous Environment. |
ICUCT |
2006 |
DBLP DOI BibTeX RDF |
life log system, spatiotemporal interface, activity analysis |
40 | James H. Andrews, Yingjun Zhang |
General Test Result Checking with Log File Analysis. |
IEEE Trans. Software Eng. |
2003 |
DBLP DOI BibTeX RDF |
Testing, specification, unit testing, test oracles, log file analysis, lightweight formal methods, safety verification |
40 | Chi-Man Pun, Moon-Chuen Lee |
Log-Polar Wavelet Energy Signatures for Rotation and Scale Invariant Texture Classification. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2003 |
DBLP DOI BibTeX RDF |
Rotation and scale invariance, shift invariant wavelet packet transform, log-polar transform, texture classification |
40 | Kjetil Nørvåg |
A Performance Evaluation of Log-Only Temporal Object Database Systems. |
SSDBM |
2000 |
DBLP DOI BibTeX RDF |
Temporal database systems, log-only database systems, object database systems |
40 | Yijie Han |
An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Algorithms, Complexity, Shortest path, Graph algorithms |
40 | Vladimir Trifonov |
An O(log n log log n) space algorithm for undirected st-connectivity. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
space-efficient simulation of parallel algorithms, undirected st-connectivity, space complexity, space-bounded computation |
39 | Omer Reingold |
Undirected connectivity in log-space. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
bounded space algorithms, Derandomization, pseudorandom generator |
39 | Omer Reingold |
Undirected ST-connectivity in log-space. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Yijie Han |
Deterministic sorting in O(nlog log n) time and linear space. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
algorithms, sorting, time complexity, linear space, integer sorting |
39 | Richard D. Regan, Alex Delis |
An Analysis of Main-Memory and Log Space Usage in Extended Ephemeral Logging. |
BNCOD |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Gecynalda S. da S. Gomes, Teresa Bernarda Ludermir |
Complementary Log-Log and Probit: Activation Functions Implemented in Artificial Neural Networks. |
HIS |
2008 |
DBLP DOI BibTeX RDF |
Complementary log-log, Probit, Neural networks, Activation function |
39 | Van Dang, W. Bruce Croft |
Query reformulation using anchor text. |
WSDM |
2010 |
DBLP DOI BibTeX RDF |
anchor log, query substitution, query expansion, query reformulation, query log, anchor text |
39 | Luo Si, Rong Jin 0001, Steven C. H. Hoi, Michael R. Lyu |
Collaborative image retrieval via regularized metric learning. |
Multim. Syst. |
2006 |
DBLP DOI BibTeX RDF |
Log-based relevance feedback, Relevance feedback log, Relevance feedback, Content-based image retrieval, Regularization, Semidefinite programming, Users, Semantic gap, Metric learning |
39 | Alexandros Nanopoulos, Dimitrios Katsaros 0001, Yannis Manolopoulos |
Exploiting Web Log Mining for Web Cache Enhancement. |
WEBKDD |
2001 |
DBLP DOI BibTeX RDF |
Prediction, Association rules, Prefetching, Web Caching, Web Log Mining |
38 | Robert Elsässer, Thomas Sauerwald |
The power of memory in randomized broadcasting. |
SODA |
2008 |
DBLP BibTeX RDF |
|
38 | Sanjiv Kapoor, Mohammad Sarwat |
Bounded-Diameter Minimum-Cost Graph Problems. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Guolong Lin, Rajmohan Rajaraman |
Approximation algorithms for multiprocessor scheduling under uncertainty. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, multiprocessor scheduling |
38 | Amitava Datta |
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System. |
J. Supercomput. |
2004 |
DBLP DOI BibTeX RDF |
pipelined bus, reconfigurable bus, matrix multiplication, addition, optical computing, prefix sum |
38 | Amit Chakrabarti, Oded Regev 0001 |
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung |
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
38 | Michelangelo Grigni, Papa A. Sissokho |
Light spanners and approximate TSP in weighted graphs with forbidden minors. |
SODA |
2002 |
DBLP BibTeX RDF |
|
38 | Yijie Han |
Improved fast integer sorting in linear space. |
SODA |
2001 |
DBLP BibTeX RDF |
|
38 | Koji Nakano, Stephan Olariu |
Uniform Leader Election Protocols in Radio Networks. |
ICPP |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder |
Allocating Weighted Jobs in Parallel. |
Theory Comput. Syst. |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Susanne Albers, Torben Hagerup |
Improved Parallel Integer Sorting Without Concurrent Writing. |
SODA |
1992 |
DBLP BibTeX RDF |
|
38 | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
Computing Shortest Paths and Distances in Planar Graphs. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
38 | Ivan Hal Sudborough |
The Time and Tape Complexity of Developmental Languages. |
ICALP |
1977 |
DBLP DOI BibTeX RDF |
|
38 | Wilson W. L. Fung, Akiomi Kunisa |
Rotation, scaling, and translation-invariant multi-bit watermarking based on log-polar mapping and discrete Fourier transform. |
ICME |
2005 |
DBLP DOI BibTeX RDF |
rotation-scaling-translation, RST-invariant multibit watermarking, LPM-DFT magnitude, watermark extraction, log-radius axis, image compression, discrete Fourier transform, log-polar mapping |
37 | Norimasa Yoshida, Ryo Fukuda, Takafumi Saito |
Log-aesthetic space curve segments. |
Symposium on Solid and Physical Modeling |
2009 |
DBLP DOI BibTeX RDF |
log-aesthetic space curves, logarithmic curvature graph, logarithmic torsion graph |
37 | Zidrina Pabarskaite, Aistis Raudys |
A process of knowledge discovery from web log data: Systematization and critical review. |
J. Intell. Inf. Syst. |
2007 |
DBLP DOI BibTeX RDF |
Survey, Personalisation, Web log mining, Data pre-processing, Web usage |
37 | Amine Laourine, Alex Stephenne, Sofiène Affes |
Capacity of log-normal fading channels. |
IWCMC |
2007 |
DBLP DOI BibTeX RDF |
equal gain combining, log normal distributions, maximum ratio combining, channel capacity |
37 | Kazimierz Kowalski, Mohsen Beheshti |
Analysis of Log Files Intersections for Security Enhancement. |
ITNG |
2006 |
DBLP DOI BibTeX RDF |
Data Mining, Security architectures, Intrusion prevention, Log files |
Displaying result #1 - #100 of 44968 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|