Search results for "I-Bit"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Carmen Pellicer-Lostao, Ricardo López-Ruiz	Pseudo-Random Bit Generation Based on 2D Chaotic Maps of Logistic Type and Its Applications in Chaotic Cryptography.	ICCSA (2)	2008	DBLP DOI BibTeX RDF	Pseudorandom Bit Generation, Chaotic Cryptography, Security Engineering
19	Ben-Shung Chow	A Very Low Bit Rate Video Coding for Ubiquitous Services.	MUE	2008	DBLP DOI BibTeX RDF	video coding, motion compensation, very low bit rate
19	Arijit Bishnu, Bhargab B. Bhattacharya	Stacked Euler Vector (SERVE): A Gray-Tone Image Feature Based on Bit-Plane Augmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	bit-plane graph, combinatorial feature, CBIR, Euler number
19	Fu-Ching Yang, Ing-Jer Huang	An Embedded Low Power/Cost 16-Bit Data/Instruction Microprocessor Compatible with ARM7 Software Tools.	ASP-DAC	2007	DBLP DOI BibTeX RDF	16 bit, ARM7 software tools, THUMB instruction set microprocessor, short-precision computing
19	Florian Dittmann 0001, Achim Rettberg, Raphael Weber	Optimization techniques for a reconfigurable, self-timed, and bit-serial architecture.	SBCCI	2007	DBLP DOI BibTeX RDF	optimization, high-level synthesis, bit-serial architecture
19	Jun Jie Foo, Ranjan Sinha	Using Redundant Bit Vectors for Near-Duplicate Image Detection.	DASFAA	2007	DBLP DOI BibTeX RDF	Near-duplicate Image Detection, Redundant Bit-Vectors, RBV
19	Anton Lokhmotov, Alan Mycroft	Optimal bit-reversal using vector permutations.	SPAA	2007	DBLP DOI BibTeX RDF	FFT, SIMD, vector, permutation, bit-reversal
19	Jongho Kim, Minseok Choi, Jechang Jeong	Adaptive Deblocking Algorithm Based on Image Characteristics for Low Bit-Rate Video.	ICIAR	2007	DBLP DOI BibTeX RDF	low bit-rate video, post-processing, deblocking filter, MPEG-4 video
19	Chiou-Yng Lee, Jenn-Shyong Horng, I-Chang Jou	Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	Galois field GF(2m), inner product, dual basis, bit-parallel systolic multiplier
19	Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski	On the bit security of the Diffie-Hellman key.	Appl. Algebra Eng. Commun. Comput.	2006	DBLP DOI BibTeX RDF	Diffie-Hellman protocol, Bit security, Exponential sums
19	Ghassen Ben Brahim, Bilal Khan 0002	Budgeting power: packet duplication and bit error rate reduction in wireless ad-hoc networks.	IWCMC	2006	DBLP DOI BibTeX RDF	low bit error rate, min-hop source routing, energy efficiency, wireless ad-hoc networks, power-aware routing
19	Ranjit Jhala, Rupak Majumdar	Bit level types for high level reasoning.	SIGSOFT FSE	2006	DBLP DOI BibTeX RDF	model checking, type inference, bit vectors
19	Markus Wedler, Dominik Stoffel, Wolfgang Kunz	Normalization at the arithmetic bit level.	DAC	2005	DBLP DOI BibTeX RDF	arithmetic bit level normalization, SAT, property checking
19	Patrick Solé, Dmitrii Zinoviev	Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over.	SETA	2004	DBLP DOI BibTeX RDF	Maximum Length Sequences, Most Significant Bit, Higher Order Correlation, Galois Rings
19	Soonhak Kwon, Heuisu Ryu	Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields.	ICOIN	2003	DBLP DOI BibTeX RDF	bit serial multiplication, optimal normal basis of type II, Finite field, dual basis, all one polynomial
19	Toshio Modegi	Very low bit-rate audio coding technique using MIDI representation.	NOSSDAV	2001	DBLP DOI BibTeX RDF	low bit-rate audio coding, sound source separation
19	Delphine Le Guen, Stéphane Pateux, Claude Labit, Gilles Moury, Dimitri Lebedeff	Bit Rate and Local Quality Control for On-Board Satellite Image Compression.	Data Compression Conference	2000	DBLP DOI BibTeX RDF	energy-based classification, local quality, wavelet, progressive transmission, bit rate control
19	Ming Zhong, Yunbo Feng, Yixian Yang	Single-Term Divisible Electronic Cash Based on Bit Commitment.	ISCC	2000	DBLP DOI BibTeX RDF	one-time knowledge proof, blind signature, electronic cash, bit commitment
19	Zhijie Shi, Ruby B. Lee	Bit Permutation Instructions for Accelerating Software Cryptography.	ASAP	2000	DBLP DOI BibTeX RDF	bit-level instructions, security, cryptography, permutations, processor architecture, Instruction Set Architecture
19	Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa	Bit-Parallel Approach to Approximate String Matching in Compressed Texts.	SPIRE	2000	DBLP DOI BibTeX RDF	compressed texts, collage system, dictionary-based compression methods, machine word, pattern length, allowed errors, dictionary size, token sequence, Ziv-Lempel compression methods, compressed length, data compression, time complexity, space complexity, approximate string matching, bit-parallelism
19	Ping Zhou, Charles Thompson	Available Bit Rate (ABR) Source Control and Delay Estimation.	LCN	2000	DBLP DOI BibTeX RDF	nonlinear estimation, ABR source control, transmission rate regulation, ABR traffic source, linear quadratic rate regulation, round-trip propagation delay estimation, nonlinear least mean square, NLMS algorithm, ATM standard, asynchronous transfer mode, ATM network, simulation results, telecommunication traffic, least squares approximations, telecommunication control, delay estimation, delay estimation, available bit rate
19	Michael R. Izquierdo, Douglas S. Reeves	A Survey of Statistical Source Models for Variable-bit-rate Compressed Video.	Multim. Syst.	1999	DBLP DOI BibTeX RDF	H.261, TES, MPEG, Self-similar, VBR, Variable bit rate, Video modeling
19	David J. Roth, David S. Wise	One-Bit Counts between Unique and Sticky.	ISMM	1998	DBLP DOI BibTeX RDF	MRB, multiple reference bit, garbage collection, storage management
19	Soo-Chul Han, John W. Woods	Frame-Rate Up-Conversion Using Transmitted Motion and Segmentation Fields for Very Low Bit-Rate Video Coding.	ICIP (1)	1997	DBLP DOI BibTeX RDF	segmentation fields, very low bit-rate video coding, motion-compensated interpolation scheme, skipped frames recovery, object-based interpretation, block-based methods, VLBR coding, up-sampling method, video coding, simulation results, motion fields, reconstruction quality, frame-rate up-conversion
19	Nuno Vasconcelos, Frédéric Dufaux	Pre and Post-Filtering for Low Bit-Rate Video Coding.	ICIP (1)	1997	DBLP DOI BibTeX RDF	post-filtering, coding artifacts, video coding, video sequence, available bandwidth, scalable architectures, H.263, computational resources, video content, prefiltering, low bit-rate video coding
19	Duke P. Hong, Tatsuya Suda	Performance of ATM available bit rate for bursty TCP sources and interfering traffic.	ICCCN	1997	DBLP DOI BibTeX RDF	available bit rate service, bursty TCP sources, rate based ABR, network resources utilization, guaranteed traffic, ABR performance, bursty interfering traffic streams, explicit rate control, bursty Internet TCP traffic, credit based quantum flow control, asynchronous transfer mode, video, bandwidth, ATM networks, simulation study, data sources, data traffic
19	Ernst W. Biersack, Frédéric Thiesse	Statistical Admission Control in Video Servers with Variable Bit-Rate Streams and Constant Time Length Retrieva.	EUROMICRO	1996	DBLP DOI BibTeX RDF	statistical admission control, constant time length retrieval, server disk, statistical service guarantee, deterministic service guarantee, quality of service, performance evaluation, video servers, network servers, disk storage, variable bit rate streams, I/O bandwidth
19	Alexandros Eleftheriadis, Arnaud E. Jacquin	Low bit rate model-assisted H.261-compatible coding of video.	ICIP	1995	DBLP DOI BibTeX RDF	object-selective quantizer control, MC DCT-CCITT Recommendation H.261, buffer rate modulation, buffer size modulation, rate control algorithm, head-and-shoulders videoteleconferencing sequences, QCIF format, 64 kbit/s, image segmentation, feature extraction, motion estimation, image sequences, video coding, video coding, discrete cosine transforms, motion compensation, video sequences, teleconferencing, transform coding, telecommunication standards, code standards, facial features, low bit rate coding
19	Ahmad Zandi, David G. Stork, James D. Allen	Optimizing bit-plane context-dependent entropy coding for palettized images.	ICIP	1995	DBLP DOI BibTeX RDF	bit plane context dependent entropy coding, palettized images, codebook bits assignment, context dependent compression, M-ary Markov model, hardware constraints, optimization, data compression, optimisation, Markov processes, image coding, greedy algorithm, context models, entropy codes
19	Issam S. Abu-Khater, Abdellatif Bellaouar, Mohamed I. Elmasry, Ran-Hong Yan	Circuit/architecture for low-power high-performance 32-bit adder.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	conditional sum architecture, CPL-like logic implementation, power supply voltage, minimum size, optimized speed, 1 to 3.3 V, logic design, CMOS, integrated circuit design, adders, adder, CMOS logic circuits, circuit optimisation, 32 bit
19	Sungju Park, Sheldon B. Akers	Parity bit calculation and test signal compaction for BIST applications.	J. Electron. Test.	1992	DBLP DOI BibTeX RDF	parity bit, test response compression, Built-in self-test, pseudo-exhaustive tests
19	Ichiro Suzuki	Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	temporal Petri nets, omega -regular expressions, Buchi-automata, formal specification, formal specification, Petri nets, formal verification, program verification, programming theory, transitions, formal analysis, automata theory, firings, formulas, alternating bit protocol, temporal operators
19	Bora Aslan, M. Tolga Sakalli, Ercan Bulus	Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings from the Point of DDT and LAT Distributions.	WAIFI	2008	DBLP DOI BibTeX RDF	Power Mappings, DDT, LAT, Classification, S-boxes
19	Zoran Cvetkovic, Ingrid Daubechies, Benjamin F. Logan	Single-Bit Oversampled A/D Conversion With Exponential Accuracy in the Bit Rate.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
19	Julie Langou, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Jack J. Dongarra	Tools and techniques for performance - Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems).	SC	2006	DBLP DOI BibTeX RDF
19	Yanju Han, Chao Xu 0006, Yizhen Zhang	An improved bit-plane and pass dual parallel architecture for coefficient bit modeling in JPEG2000.	ASP-DAC	2005	DBLP DOI BibTeX RDF
19	Cao An Wang	Efficiently Updating Constrained Delaunay Triangulations.	BIT	1993	DBLP DOI BibTeX RDF
19	Evan P. Harris, Kotagiri Ramamohanarao	Optimal Dynamic Multi-Attribute Hashing for Range Queries.	BIT	1993	DBLP DOI BibTeX RDF
19	Ondrej Sýkora, Imrich Vrto	On Crossing Numbers of Hypercubes and Cube Connected Cycles.	BIT	1993	DBLP DOI BibTeX RDF
19	Jinn-Ke Jan, Chin-Chen Chang 0001	A Key-Lock-Pair Oriented Access Control Scheme for the Growth of Users and Files.	BIT	1993	DBLP DOI BibTeX RDF
19	Jong-Jeng Chen, Chiau-Shin Wang, Ching-Roung Chou	A General Performance Analysis Method for Uniform Memory Architectures.	BIT	1993	DBLP DOI BibTeX RDF
19	M. D. Atkinson, Murali Thiyagarajah	The Permutational Power of a Priority Queue.	BIT	1993	DBLP DOI BibTeX RDF
19	Chang-Wu Yu 0001, Gen-Huey Chen	Parallel Algorithms for Permutation Graphs.	BIT	1993	DBLP DOI BibTeX RDF
19	Chin-Chen Chang 0001, Huey-Cheue Kowng, Tzong-Chen Wu	A Refinement of a Compression-Oriented Addressing Scheme.	BIT	1993	DBLP DOI BibTeX RDF
19	Roland Olsson 0001	Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search.	BIT	1993	DBLP DOI BibTeX RDF
19	Giorgio Gambosi, Marco Protasi, Maurizio Talamo	An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets.	BIT	1993	DBLP DOI BibTeX RDF
19	Lars Lundberg	Performance Bounds on Multiprocessor Scheduling Strategies for Statically Allocated Programs.	BIT	1993	DBLP DOI BibTeX RDF
19	Klaus Jansen, Gerhard J. Woeginger	The Complexity of Detecting Crossingfree Configurations in the Plane.	BIT	1993	DBLP DOI BibTeX RDF
19	Hong Chich Chou, Chung-Ping Chung	Modeling of Superscalar Instruction Scheduling and Analysis of a Heuristic Scheduling Algorithm.	BIT	1993	DBLP DOI BibTeX RDF
19	Chiou-Kuo Liang	An O(n2) Algorithm for Finding the Compact Sets of a Graph.	BIT	1993	DBLP DOI BibTeX RDF
19	Horng-Twu Liaw, Chin-Laung Lei	An Optimal Algorithm to Assign Cryptographic Keys in a Tree Structure for Access Control.	BIT	1993	DBLP DOI BibTeX RDF
19	Celina Imielinska, Bahman Kalantari	A Generalized Hypergreedy Algorithm for Weighted Perfect Matching.	BIT	1993	DBLP DOI BibTeX RDF
19	Patricio V. Poblete	A Note on the Height of The kthe Element in a Heap.	BIT	1993	DBLP DOI BibTeX RDF
19	Ming-Shing Yu, Cheng-Hsing Yang	A Linear Time Algorithm for the Maximum Matching Problem on Cographs.	BIT	1993	DBLP DOI BibTeX RDF
19	Ronald D. Dutton	Weak-Heap Sort.	BIT	1993	DBLP DOI BibTeX RDF
19	Olav Lysne	The Equational Part of Proofs by Structural Induction.	BIT	1993	DBLP DOI BibTeX RDF
19	Stephan Olariu, James L. Schwing, Jingyuan Zhang	Optimal Convex Hull Algorithms on Enhanced Meshes.	BIT	1993	DBLP DOI BibTeX RDF
19	Iain A. Stewart	An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets.	BIT	1993	DBLP DOI BibTeX RDF
19	Dharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang	Selection on Rectangular Meshes with Multiple Broadcasting.	BIT	1993	DBLP DOI BibTeX RDF
19	Francesca Cesarini, Giovanni Soda	Single Access Hashing with Overflow Separators for Dynamic Files.	BIT	1993	DBLP DOI BibTeX RDF
19	Thierry Coquand	The Paradox of Trees in Type Theory.	BIT	1992	DBLP DOI BibTeX RDF
19	Rong-Hong Jan, Lih-Hsing Hsu, Yueh-Ying Lee	The Most Vital Edges with Respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs.	BIT	1992	DBLP DOI BibTeX RDF
19	Anne Salvesen	On Specifications, Subset Types and Interpretation of Proposition in Type Theory.	BIT	1992	DBLP DOI BibTeX RDF
19	Mamoru Hoshi, Philippe Flajolet	Page Usage in a Quadtree Index.	BIT	1992	DBLP DOI BibTeX RDF
19	Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee	Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and N-Step SCAN.	BIT	1992	DBLP DOI BibTeX RDF
19	Jeannette M. de Graaf, Walter A. Kosters	Expected Heights in Heaps.	BIT	1992	DBLP DOI BibTeX RDF
19	Daniel Fredholm, Svetozar Serafimovski	Partial Inductive Definitions as Type-Systems for lambda-Terms.	BIT	1992	DBLP DOI BibTeX RDF
19	Lars Hallnäs	On Systems of Definitions, Induction and Recursion.	BIT	1992	DBLP DOI BibTeX RDF
19	Kris Coolsaet, Hans E. De Meyer, Veerle Fack	Optimal Algorithms for Total Exchange without Buffering on the Hypercube.	BIT	1992	DBLP DOI BibTeX RDF
19	Ravi B. Boppana, Magnús M. Halldórsson	Approximating Maximum Independent Sets by Excluding Subgraphs.	BIT	1992	DBLP DOI BibTeX RDF
19	Grigori Mints	Complexity of Subclasses of the Intuitionistic Propositional Calculus.	BIT	1992	DBLP DOI BibTeX RDF
19	Johann Blieberger, Ulrich Schmid 0001	FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions.	BIT	1992	DBLP DOI BibTeX RDF
19	Stephan Olariu, James L. Schwing, Jingyuan Zhang	A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes.	BIT	1992	DBLP DOI BibTeX RDF
19	John Hershberger 0001, Subhash Suri	Applications of a Semi-Dynamic Convex Hull Algorithm.	BIT	1992	DBLP DOI BibTeX RDF
19	Jyrki Katajainen, Tomi Pasanen	Stable Minimum Space Partitioning in Linear Time.	BIT	1992	DBLP DOI BibTeX RDF
19	Mark Levene, George Loizou	Inferring Null Join Dependencies in Relational Databases.	BIT	1992	DBLP DOI BibTeX RDF
19	Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis	Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs.	BIT	1992	DBLP DOI BibTeX RDF
19	Christos Levcopoulos, Andrzej Lingas	Fast Algorithms for Greedy Triangulation.	BIT	1992	DBLP DOI BibTeX RDF
19	Chang-Wu Yu 0001, Gen-Huey Chen	The Weighted Maximum Independent Set Problem in Permutation Graphs.	BIT	1992	DBLP DOI BibTeX RDF
19	A. Louise Perkins	A Mixed Directed-Undirected Data Structure for a Parallel Implementation of a Domain Decomposition Algorithm.	BIT	1992	DBLP DOI BibTeX RDF
19	Erik Palmgren, Viggo Stoltenberg-Hansen	Remarks on Martin-Löf's Partial Type Theory.	BIT	1992	DBLP DOI BibTeX RDF
19	Harry G. Mairson	The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions.	BIT	1992	DBLP DOI BibTeX RDF
19	David Eppstein	Finding the k Smallest Spanning Trees.	BIT	1992	DBLP DOI BibTeX RDF
19	Stefan Arnborg, Andrzej Proskurowski	Canonical Representations of Partial 2- and 3-Trees.	BIT	1992	DBLP DOI BibTeX RDF
19	Joëlle Despeyroux	Theo: An Interactive Proof Development System.	BIT	1992	DBLP DOI BibTeX RDF
19	Loïc Colson	On List Primitive Recursion and the Complexity of Computing inf.	BIT	1992	DBLP DOI BibTeX RDF
19	Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani	Improved Bounds for the Expected Behaviour of AVL Trees.	BIT	1992	DBLP DOI BibTeX RDF
19	Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal	Intersection Queries in Sets of Disks.	BIT	1992	DBLP DOI BibTeX RDF
19	Thomas Papadakis, J. Ian Munro, Patricio V. Poblete	Average Search and Update Costs in Skip Lists.	BIT	1992	DBLP DOI BibTeX RDF
19	Kim-Heng Teo, Tai-Ching Tuan	A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths.	BIT	1991	DBLP DOI BibTeX RDF
19	H. Van de Vel, Sun Shijie	A Modification of Hochbaum and Shmoys' Algorithm for Scheduling Problems.	BIT	1991	DBLP DOI BibTeX RDF
19	Marc J. van Kreveld, Mark de Berg	Finding Squares and Rectangles in Sets of Points.	BIT	1991	DBLP DOI BibTeX RDF
19	Frank Bartling, Klaus H. Hinrichs	Probabilistic Analysis of an Algorithm for Solving the k-Dimensional All-Nearest-Neighbors Problem by Projection.	BIT	1991	DBLP DOI BibTeX RDF
19	Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher	Efficient Reduction for Path Problems on Circular-Arc Graphs.	BIT	1991	DBLP DOI BibTeX RDF
19	Lung-Tien Liu, Gen-Huey Chen, Yue-Li Wang	A Note on Optimal Multiway Split Trees.	BIT	1991	DBLP DOI BibTeX RDF
19	Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo	The Set Union Problem with Dynamic Weighted Backtracking.	BIT	1991	DBLP DOI BibTeX RDF
19	Ben Johnsen	Generating Binary Trees with Uniform Probability.	BIT	1991	DBLP DOI BibTeX RDF
19	Andrzej Lingas	An Unfeasible Matching Problem.	BIT	1991	DBLP DOI BibTeX RDF
19	Haijo Schipper, Mark H. Overmars	Dynamic Partition Trees.	BIT	1991	DBLP DOI BibTeX RDF
19	Juha Puustjärvi	Distributed Management of Transactions in Heterogeneous Distributed Database Systems.	BIT	1991	DBLP DOI BibTeX RDF