|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1953 occurrences of 1282 keywords
|
|
|
Results
Found 10495 publication records. Showing 10495 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
14 | Steven M. Bellovin |
A technique for counting natted hosts. |
Internet Measurement Workshop |
2002 |
DBLP DOI BibTeX RDF |
|
14 | James A. Reeds, Peter C. Fishburn |
Counting Split Interval Orders. |
Order |
2001 |
DBLP DOI BibTeX RDF |
forbidden posets, split interval order, partial order, interval order |
14 | Erik Klintskog, Anna Neiderud, Per Brand, Seif Haridi |
Fractional Weighted Reference Counting. |
Euro-Par |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Pierrick Gaudry, Nicolas Gürel |
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves. |
ASIACRYPT |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Mitchell A. Harris |
Counting Satisfiable k-CNF Formulas. |
CP |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Jayant Deodhar, Spyros Tragoudas |
Color Counting and its Application to Path Delay Fault Coverage. |
ISQED |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos |
Acceptor-Definable Counting Classes. |
Panhellenic Conference on Informatics |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos |
Counting H-Colorings of Partial k-Trees. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Peter Dickman |
Diffusion Tree Restructuring for Indirect Reference Counting. |
ISMM |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Florian Waas, César A. Galindo-Legaria |
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer. |
SIGMOD Conference |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum |
On the relative complexity of approximate counting problems. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
On Counting Independent Sets in Sparse Graphs. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Vera M. Kettnaker, Ramin Zabih |
Counting People from Multiple Cameras. |
ICMCS, Vol. 2 |
1999 |
DBLP DOI BibTeX RDF |
tracking, motion analysis, video surveillance |
14 | Luc Moreau 0001 |
Hierarchical Distributed Reference Counting. |
ISMM |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Ming-Deh A. Huang, Yiu-Chung Wong |
An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite Fields. |
ANTS |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Gilles Brassard, Peter Høyer, Alain Tapp |
Quantum Counting. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Giovanni Manzini |
Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Noboru Kunihiro, Kenji Koyama |
Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Zn and Factoring n. |
EUROCRYPT |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Aura Conci, Claudia Belmiro Proença |
A Box-Counting Approach to Color Segmentation. |
ICIP (1) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Leszek Pacholski, Wieslaw Szwast, Lidia Tendera |
Complexity of Two-Variable Logic with Counting. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Erich Grädel, Martin Otto 0001, Eric Rosen |
Two-Variable Logic with Counting is Decidable. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Philippe Clauss |
Handling Memory Cache Policy with Integer Points Counting. |
Euro-Par |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Klaus Meer |
Counting Problems over the Reals. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Xiaoyong Du 0001, Zhibin Liu, Naohiro Ishii |
Counting-Based Normalization for Multiple Linear Recursions. |
DEXA |
1996 |
DBLP DOI BibTeX RDF |
|
14 | Tetsuo Asano |
Reporting and Counting Intersections of Lines within a Polygon. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Noga Alon, Raphael Yuster, Uri Zwick |
Finding and Counting Given Length Cycles (Extended Abstract). |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Carsten Damm, Markus Holzer 0001 |
Inductive Counting Below LOGSPACE. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Ursula Martin |
Linear Interpretations by Counting Patterns. |
RTA |
1993 |
DBLP DOI BibTeX RDF |
|
14 | Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel 0003 |
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. |
FSTTCS |
1993 |
DBLP DOI BibTeX RDF |
|
14 | Carsten Damm, Matthias Krause 0001, Christoph Meinel, Stephan Waack |
Separating Counting Communication Complexity Classes. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
complexity of Boolean function, communication complexity and distributed computing, probabilism, lower bound arguments, separation of complexity classes |
14 | Andreas Potthoff |
Modulo Counting Quantifiers Over Finite Trees. |
CAAP |
1992 |
DBLP DOI BibTeX RDF |
|
14 | Marie-Pierre Delest, Jean-Marc Fedou |
Counting Polyominoes Using Attribute Grammars. |
WAGA |
1990 |
DBLP DOI BibTeX RDF |
|
14 | Marek Piotrów |
On Complexity of Counting. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
14 | David I. Bevan |
Distributed Garbage Collection Using Reference Counting. |
PARLE (2) |
1987 |
DBLP DOI BibTeX RDF |
|
14 | Sami Khuri |
Counting nodes in binary trees. |
SIGCSE |
1986 |
DBLP DOI BibTeX RDF |
|
14 | Peter Wegner |
A technique for counting ones in a binary computer. |
Commun. ACM |
1960 |
DBLP DOI BibTeX RDF |
|
13 | Yan Zhang 0002 |
Handoff Performance in Wireless Mobile Networks with Unreliable Fading Channel. |
IEEE Trans. Mob. Comput. |
2010 |
DBLP DOI BibTeX RDF |
handoff counting, handoff rate, handoff probability, call holding time, wireless resilience, Wireless networks, handoff, Rayleigh fading channel, cell residence time |
13 | Bastian Laubner |
Capturing Polynomial Time on Interval Graphs. |
LICS |
2010 |
DBLP DOI BibTeX RDF |
capturing of polynomial time, fixed-point logic with counting, interval graphs, canonical forms, modular decomposition |
13 | Micha Sharir, Adam Sheffer, Emo Welzl |
On degrees in random triangulations of point sets. |
SCG |
2010 |
DBLP DOI BibTeX RDF |
crossing-free geometric graphs, degree sequences, number of triangulatons, random triangulations, counting, charging, plane graphs |
13 | Wenhui Li 0002, Ying Wang 0024, Bo Fu, Yifeng Lin |
Coal and Coal Gangue Separation Based on Computer Vision. |
FCST |
2010 |
DBLP DOI BibTeX RDF |
lifting wavelet transform, advanced Differential Box Counting, coal gangue separation, pattern recognition, computer vision |
13 | Chin-Yang Lin, Ting-Wei Hou, Fuh-Gwo Chen |
A Snapshot-Based Evaluation Method for Garbage Collection. |
IIH-MSP |
2010 |
DBLP DOI BibTeX RDF |
evaluation, garbage collection, reference counting |
13 | Man Lung Yiu, Nikos Mamoulis |
Multi-dimensional top-k dominating queries. |
VLDB J. |
2009 |
DBLP DOI BibTeX RDF |
Preference dominance, Score counting, Top-k retrieval |
13 | Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara |
Random Generation and Enumeration of Bipartite Permutation Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
Bipartite permutation graph, Dyck path, Motzkin path, enumeration, counting, random generation |
13 | Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara |
Random Generation and Enumeration of Proper Interval Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
proper interval graphs, unit interval graphs, enumeration, Counting, random generation |
13 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh 0001, Dimitrios M. Thilikos |
(Meta) Kernelization. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Polynonial Time Preprocessing, Counting Monadic Second Order Logic, Finite Integer Index, Graphs of Bounded Genus, Planar Graphs, Kernelization, Parameterized Algorithms, Finite State |
13 | James Newsome, Stephen McCamant, Dawn Song |
Measuring channel capacity to distinguish undue influence. |
PLAS |
2009 |
DBLP DOI BibTeX RDF |
model counting, quantitative information flow, channel capacity |
13 | Takakazu Satoh |
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields. |
EUROCRYPT |
2009 |
DBLP DOI BibTeX RDF |
point counting, hyperelliptic curve |
13 | Duan-Yu Chen, Kuan-Yi Lin |
A Novel Viewer Counter for Digital Billboards. |
IIH-MSP |
2009 |
DBLP DOI BibTeX RDF |
viewer counting |
13 | Zhenmei Li, Wenge Li, Boxue Tan, Jin Shen |
Measurement System of Diameters of Ultrafine Particles Based on Virtual Instrument. |
JCAI |
2009 |
DBLP DOI BibTeX RDF |
photon counting, measurement, inversion, virtual instrument, Particles |
13 | Éric Fusy, Gilles Schaeffer, Dominique Poulalhon |
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Bijection, coding, counting, random generation |
13 | Johann A. Makowsky |
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Graph polynomials, Combinatorial counting functions, Descriptive complexity |
13 | Manuel Rubio-Sánchez, Jaime Urquiza-Fuentes, Cristóbal Pareja-Flores |
A gentle introduction to mutual recursion. |
ITiCSE |
2008 |
DBLP DOI BibTeX RDF |
recursion problems, combinatorics, counting problems, fibonacci numbers, mutual recursion |
13 | Stefan Kotowski, Witold Kosinski, Zbigniew Michalewicz, Jakub Nowicki, Bartosz Przepiórkiewicz |
Fractal Dimension of Trajectory as Invariant of Genetic Algorithms. |
ICAISC |
2008 |
DBLP DOI BibTeX RDF |
box-counting dimension, genetic algorithm, entropy, dynamical system, fractal dimension |
13 | M. Teresa Higuera-Toledano |
Making stronger and flexible the single parent rule in the real-time specification of Java. |
JTRES |
2008 |
DBLP DOI BibTeX RDF |
illegal assignments, reference-counting collection, scoped-regions, single parent rule, real-time Java, write-barriers |
13 | Min Cai, Kai Hwang 0001, Jianping Pan 0001, Christos Papadopoulos |
WormShield: Fast Worm Signature Generation with Distributed Fingerprint Aggregation. |
IEEE Trans. Dependable Secur. Comput. |
2007 |
DBLP DOI BibTeX RDF |
distributed aggregation tree, cardinality counting, Network security, distributed hash table, traffic measurement, Internet worms, signature generation, worm containment |
13 | Chang-Wu Yu 0001 |
Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
subgraph counting, subgraph probability, Random geometric graphs |
13 | Matthew Might |
Logic-flow analysis of higher-order programs. |
POPL |
2007 |
DBLP DOI BibTeX RDF |
LFA, abstract counting, abstract garbage collection, environment analysis, gamma-CFA first-order logic, logic-flow analysis, static analysis, theorem proving, lambda calculus, CPS |
13 | Jiang Yu Zheng, Shivank Sinha |
Line cameras for monitoring and surveillance sensor networks. |
ACM Multimedia |
2007 |
DBLP DOI BibTeX RDF |
background adapting, image projection, line sensor, target counting, sensor networks, surveillance, transmission |
13 | Hiroki Urata, Teijiro Isokawa, Yoichi Seki, Naotake Kamiura, Nobuyuki Matsui, Hidetoshi Ikeno, Ryohei Kanzaki |
Three-Dimensional Classification of Insect Neurons Using Self-organizing Maps. |
KES (3) |
2007 |
DBLP DOI BibTeX RDF |
SOM’s, Box-counting, Interneuron classification |
13 | Maurice Herlihy, Srikanta Tirthapura |
Self-stabilizing smoothing and balancing networks. |
Distributed Comput. |
2006 |
DBLP DOI BibTeX RDF |
Smoothing networks, Self-stabilization, Counting networks |
13 | Pankaj K. Agarwal, David J. Brady, Jirí Matousek 0001 |
Segmenting object space by geometric reference structures. |
ACM Trans. Sens. Networks |
2006 |
DBLP DOI BibTeX RDF |
prbobabilistic methods, space segmentation, Sensor network, counting problems |
13 | Micha Sharir, Emo Welzl |
Random triangulations of planar point sets. |
SCG |
2006 |
DBLP DOI BibTeX RDF |
crossing-free geometric graphs, crossing-free spanning trees, degree sequences, number of triangulations, random triangulations, counting, charging |
13 | Luc Moreau 0001, Peter Dickman, Richard E. Jones |
Birrell's distributed reference listing revisited. |
ACM Trans. Program. Lang. Syst. |
2005 |
DBLP DOI BibTeX RDF |
distributed reference counting/listing, proof of correctness, Distributed garbage collection |
13 | Leonid Meyerguz, David Kempe 0001, Jon M. Kleinberg, Ron Elber |
The evolutionary capacity of protein structures. |
RECOMB |
2004 |
DBLP DOI BibTeX RDF |
evolutionary networks, rapidly mixing Markov chains, protein structure, approximate counting |
13 | Srikanta Tirthapura |
Brief announcement: adaptive balancing networks. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
balancing networks, adaptive, peer-to-peer systems, counting networks |
13 | Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya |
An Efficient Parallel Prefix Sums Architecture with Domino Logic. |
IEEE Trans. Parallel Distributed Syst. |
2003 |
DBLP DOI BibTeX RDF |
shift switching, binary prefix sums, binary counting, VLSI design, scalable architectures, domino logic, Hardware-algorithms |
13 | Francesco Camastra, Alessandro Vinciarelli |
Estimating the Intrinsic Dimension of Data with a Fractal-Based Method. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2002 |
DBLP DOI BibTeX RDF |
correlation integral, Grassberger-Procaccia's algorithm, nonlinear principal component analysis, box-counting dimension, Kolmogorov capacity, fractal dimension, Bayesian information criterion, intrinsic dimension |
13 | Sanjeev Kumar, Kai Li 0001 |
Dynamic memory management for programmable devices. |
MSP/ISMM |
2002 |
DBLP DOI BibTeX RDF |
programmable devices, model checking, reference counting, dynamic memory management |
13 | Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya |
Scalable Hardware-Algorithms for Binary Prefix Sums. |
IEEE Trans. Parallel Distributed Syst. |
2000 |
DBLP DOI BibTeX RDF |
shift switching, binary prefix sums, binary counting, pipelining, scalable architectures, Hardware-algorithms |
13 | Saleh E. Abdullahi, Graem A. Ringwood |
Garbage Collecting the Internet: A Survey of Distributed Garbage Collection. |
ACM Comput. Surv. |
1998 |
DBLP DOI BibTeX RDF |
automatic storage reclamation, distributed object-oriented management, distributed, object-oriented databases, memory management, distributed file systems, distributed memories, network communication, reference counting |
13 | Yue-Li Wang, Hon-Chan Chen, Wei-Kai Liu |
A Parallel Algorithm for Constructing a Labeled Tree. |
IEEE Trans. Parallel Distributed Syst. |
1997 |
DBLP DOI BibTeX RDF |
Cayley's tree formula, dominance counting problem, Prüfer mapping, parallel algorithms, labeled trees |
13 | Jeffrey Hammes, A. P. Wim Böhm |
Towards a Time and Space Efficient Functional Implementation of a Monte Carlo Photon Transport Code. |
IEEE PACT |
1997 |
DBLP DOI BibTeX RDF |
Strictness, Performance Evaluation, Parallelism, Functional Programming, Monte Carlo Simulation, Reference Counting, Sisal |
13 | Jo Ann Lane, David Zubrow |
Intergrating Measurement with Improvement: An Action-Oriented Approach (Experience Report). |
ICSE |
1997 |
DBLP DOI BibTeX RDF |
counting rules, software measurement definitions, software measurement goals, software process improvement, productivity, cycle time, software development cost |
13 | Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou |
Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
discrepancy sets, combinatorial rectangles, common subproblem, DNF approximate counting, discrepancy problem, poly(n)-size sample space, random number generation, pseudorandom generators |
13 | Martin Grohe |
Equivalence in Finite-Variable Logics is Complete for Polynomial Time. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
finite-variable logics, finite structures, graph isomorphism problem, complexity theoretic difficulties, quantifier-free reductions, completeness result, counting quantifiers, computational complexity, first order logic, polynomial time, equivalence |
13 | Kazuyuki Amano, Akira Maruoka |
Potential of the Approximation Method (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
precise versions, bottleneck counting argument, sunflower contraction, lower bounds, Boolean functions, vertices, cliques, approximation method, monotone circuit |
13 | Ravi Kumar 0001, D. Sivakumar 0001 |
Efficient Self-Testing/Self-Correction of Linear Recurrences. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
efficient self-testing, efficient self-correction, self-tester design, self-corrector design, result-checkers, linear function testing, counting arguments, matrix twist, convolution identities, VLSI chip testing, randomness-efficient self-tester, rational domains, signal processing, finite fields, program testing, polynomials, reduction, functions, spectral analysis, matrix groups, linear recurrences, control engineering |
13 | David S. Wise, Joshua Walgenbach |
Static and Dynamic Partitioning of Pointers as Links and Threads. |
ICFP |
1996 |
DBLP DOI BibTeX RDF |
tags, garbage collection, storage management, reference counting |
13 | Philippe Clauss, Vincent Loechner |
Parametric Analysis of Polyhedral Iteration Spaces. |
ASAP |
1996 |
DBLP DOI BibTeX RDF |
parametric vertices, parametric counting, Ehrhart polynomials, automatic parallelization, nested loops, convex polyhedra |
13 | Dimitrios Kagaris, Spyros Tragoudas |
Generating deterministic unordered test patterns with counters. |
VTS |
1996 |
DBLP DOI BibTeX RDF |
counting circuits, deterministic unordered test patterns, counter-based schemes, built-in mechanisms, test pattern generation session, ISCAS'85 benchmarks, logic testing, built-in self test, integrated circuit testing, combinational circuits, combinational circuits, automatic testing, hardware overhead |
13 | Robert Michael Owens, Raminder Singh Bajwa, Mary Jane Irwin |
Reducing the number of counters needed for integer multiplication. |
IEEE Symposium on Computer Arithmetic |
1995 |
DBLP DOI BibTeX RDF |
counting circuits, reasonably small integers, partial product accumulation, aperiodic convolution, convolution algorithms, partial product formulation, fairly large integers, digital arithmetic, multiplying circuits, counters, integer multiplication |
13 | Andreas Brandt 0001, Manfred Brandt |
On the distribution of the number of packets in the fluid flow approximation of packet arrival streams. |
Queueing Syst. Theory Appl. |
1994 |
DBLP DOI BibTeX RDF |
Fluid flow approximation, Markov modulated rate processes, counting process, asymptotical normality, complex integration, numerical integration, bursty traffic, superposition |
13 | Ravi Kannan |
Markov Chains and Polynomial Time Algorithms |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
approximately certain, Markov Chains, randomized algorithms, polynomial time algorithms, perfect matchings, counting problems |
13 | Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák |
Lower Bound on Hilbert's Nullstellensatz and propositional proofs |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
propositional formulas, Hilbert's Nullstellensatz, propositional proofs, modular counting principle, fixed cardinality, algebraic equations |
13 | Henk Corporaal |
Distributed Heapmanagement using reference weights. |
EDMCC |
1991 |
DBLP DOI BibTeX RDF |
synchronization, Distributed processing, garbage collection, reference counting, real-time performance |
13 | Bong-Rad Choi, Kyu Ho Park, Myunghwan Kim 0001 |
An Improved Hardware Implementation of the Fault-Tolerant Clock Synchronization Algorithm for Large Multiprocessor Systems. |
IEEE Trans. Computers |
1990 |
DBLP DOI BibTeX RDF |
fault-tolerant clock synchronization algorithm, large multiprocessor systems, malicious faults, reference clock selection, lower gate complexity, smaller time delay, sorter, counting encoder, threshold generation logic, programmable registers, gate complexity, fault tolerant computing, multiprocessing systems, synchronisation |
13 | Abhijit Chatterjee, Jacob A. Abraham |
The Testability of Generalized Counters Under Multiple Faulty Cells. |
IEEE Trans. Computers |
1990 |
DBLP DOI BibTeX RDF |
generalized counters, multiple faulty cells, counting circuits, logic testing, fault model, testability, adders, full adders |
13 | Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann 0001, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger |
Drawing Graphs in the Plane with High Resolution |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
high resolution planar graph drawing, straight line edges, minimum angle, incident edges, maximum node degree, hypercubes, NP-hard problem, counting, complete graphs, tori, multidimensional meshes |
13 | Cheng Hsien Tung, John P. Robinson |
A Fast Algorithm for Optimum Syndrome Space Compression. |
IEEE Trans. Computers |
1988 |
DBLP DOI BibTeX RDF |
optimum syndrome space compression, multiple-output combinational circuits, counting for time compression, built-in selftest, output response data compression, fast Walsh transform, logic testing, data compression, transforms, automatic testing, combinatorial circuits, Walsh functions |
13 | Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
combinatorial complexity bounds, incidence counting, many-faces problem, pseudolines, unit circles, general circles, pseudocircles, three-dimensional unit-distance problem, upper bounds, surfaces, curves, lines, three dimensions, spheres |
13 | Kolar L. Kodandapani, Sharad C. Seth |
On Combinational Networks with Restricted Fan-Out. |
IEEE Trans. Computers |
1978 |
DBLP DOI BibTeX RDF |
single fault location, Characterization of fan-out-free networks, counting of fan-out-free, fan-out-free networks, localized fan outs, functional decomposition, combinational networks, multiple fault detection |
13 | John P. Hayes |
Generation of Optimal Transition Count Tests. |
IEEE Trans. Computers |
1978 |
DBLP DOI BibTeX RDF |
transition counting, fault tables, test generation, fault detection, Combinational circuits, fault location, optimal tests |
13 | Tatsuo Higuchi 0001, Michitaka Kameyama |
Static-Hazard-Free T-Gate for Ternary Memory Element and Its Application to Ternary Counters. |
IEEE Trans. Computers |
1977 |
DBLP DOI BibTeX RDF |
Counter based on shift register, emitter coupled logic (ECL), feedback shift register (FSR), signed ternary number representation, static-hazard-free T-gate, symmetrical modulo-M counter, synchronous and asynchronous signed ternary counter, ternary memory element, up-down counting |
13 | Rafael Maranzato, Adriano C. M. Pereira, Alair Pereira do Lago, Marden Neubert |
Fraud detection in reputation systems in e-markets using logistic regression. |
SAC |
2010 |
DBLP DOI BibTeX RDF |
fraud evidence, trust management, logistic regression, reputation systems, fraud detection, e-markets |
13 | Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum |
Distributed hash sketches: Scalable, efficient, and accurate cardinality estimation for distributed multisets. |
ACM Trans. Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
distributed cardinality estimation, distributed data summary structures, hash sketches, peer-to-peer networks and systems, distributed information systems, Distributed estimation |
13 | Yin Wang, Xiangming Wen, Xinqi Lin, Peizhou He, Wei Zheng 0001 |
A Novel Video Shot Segmentation Based on Textural Features. |
IAS |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht |
Hypergraph regularity and quasi-randomness. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Andreas Bauer 0002, Rajeev Goré, Alwen Tiu |
A First-Order Policy Language for History-Based Transaction Monitoring. |
ICTAC |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Feng Yang, Ke Zhi Mao |
Entropy-based Criteria Dealing with the Ties Problem in Gene Selection. |
ACIS-ICIS |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #601 - #700 of 10495 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ 16][ >>] |
|