Search results for "n-ary"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
117	Bijan Davvaz, Osman Kazanci, Sultan Yamak	Interval-valued fuzzy n-ary subhypergroups of n-ary hypergroups.	Neural Comput. Appl.	2009	DBLP DOI BibTeX RDF	Hypergroup, n-ary hypergroup, Belong to, Quasicoincident with, n-ary subhypergroup, Fuzzy (?, ? ?q)-fuzzy n-ary subhypergroup, Fuzzy set
99	John Case, Samuel E. Moelius	Independence Results for n-Ary Recursion Theorems.	FCT	2009	DBLP DOI BibTeX RDF
90	Gang Wang, Qishan Zhang	The novel generating algorithm and properties of hybrid-P-ary generalized bridge functions.	Sci. China Ser. F Inf. Sci.	2006	DBLP DOI BibTeX RDF	hybrid-P-ary generalized Walsh functions, hybrid-P-ary generalized shift copy, hybrid-P-ary generalized bridge functions
83	Renwei Ge, Gonzalo R. Arce, Giovanni Di Crescenzo	Approximate Message Authentication Codes for N-ary Alphabets.	IEEE Trans. Inf. Forensics Secur.	2006	DBLP DOI BibTeX RDF
75	Zhiquan Bai, Dongfeng Yuan, Xiaotong Li, Rongkai Li, Kyungsup Kwak	Performance evaluation of multiple access M-ary DS-UWB communication system.	IWCMC	2009	DBLP DOI BibTeX RDF	M-ary modulation, direct sequence spread spectrum (DSSS), ultra wideband (UWB), multiple access
67	Raffaele Mascella, Luca G. Tallini	Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Coding and information theory, m{hbox{-}}rm ary communication, line codes, DC-free communication, delay-insensitive communication, error control codes, digital communication, constant weight codes, balanced codes
59	Haruhiko Kaneko, Eiji Fujiwara	A Class of M-Ary Asymmetric Symbol Error Correcting Codes for Data Entry Devices.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Asymmetric symbol errors, asymmetric error control codes, error directionality graph, data entry devices, graph coloring, ring, confusion matrix
59	Loïc Cerf, Jérémy Besson, Céline Robardet, Jean-François Boulicaut	Closed patterns meet n-ary relations.	ACM Trans. Knowl. Discov. Data	2009	DBLP DOI BibTeX RDF	n-ary relations, constraint properties, tiling, constraint-based mining, Closed patterns
59	YongHwan Kim, Sungsoo Kim, Seongjoon Lee, Kwangseon Ahn	An anti-collision algorithm without idle cycle using 4-ary tree in RFID system.	ICUIMC	2009	DBLP DOI BibTeX RDF	4-ary query tree, idle-cycle, the number of query-responses, RFID, anti-collision
59	Kevin T. Phelps, Josep Rifà, Mercè Villanueva	Kernels and p-Kernels of pr-ary 1-Perfect Codes.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	q-ary codes, nonlinear codes, rank, kernel, perfect codes
59	Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim 0001	Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	performance evaluation, partitioning, job scheduling, processor allocation, k-ary n-cube
59	Ding-Ming Kwai, Behrooz Parhami	A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes.	ICPP	1997	DBLP DOI BibTeX RDF	fixed-degree network, pruning strategy, interconnection network, Cayley graph, k-ary n-cube, cube-connected cycles
59	Ryutaro Murakami, Yoshiteru Ohkura, Ryosaku Shimada	2k-ary Cyclic AN Codes for Burst Error Correction.	ISMVL	1995	DBLP DOI BibTeX RDF	2/sup k/-ary cyclic AN codes, burst error correction, radix 2/sup k/ expressions, code structure, arithmetic burst errors, burst error correction ability, binary cyclic AN code, error correction codes, error detection, error detection codes, arithmetic codes, arithmetic operations, cyclic codes
58	Gonzalo Génova, Juan Lloréns, Paloma Martínez	The meaning of multiplicity of n-ary associations in UML.	Softw. Syst. Model.	2002	DBLP DOI BibTeX RDF	ternary association, n-ary association, ternary relationship, n-ary relationship, UML, data modeling, multiplicity, entity-relationship modeling, cardinality
54	Mihaela Butaru, Zineb Habbas	Solving the Car-Sequencing Problem as a Non-binary CSP.	CP	2005	DBLP DOI BibTeX RDF	n-ary CSPs, n-ary Forward Checking, scheduling, heuristics, constraint satisfaction, problem solving
52	Shu-Tao Xia, Fang-Wei Fu 0001	Undetected error probability of q -ary constant weight codes.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	94B70, AMS Classifications 94B05, 94B65, 05B05
52	Aurélien Lemay, Joachim Niehren, Rémi Gilleron	Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.	ICGI	2006	DBLP DOI BibTeX RDF
52	Rajeev Raman, Venkatesh Raman 0001, S. Srinivasa Rao 0001	Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.	SODA	2002	DBLP BibTeX RDF
51	Bijan Davvaz	Approximations in n -ary algebraic systems.	Soft Comput.	2008	DBLP DOI BibTeX RDF	Algebraic system, n-ary semigroup, Rough set, Fuzzy set, Upper approximation, Lower approximation
51	XiaoHu Tang	On the linear span of the p -ary cascaded GMW sequences.	Sci. China Ser. F Inf. Sci.	2007	DBLP DOI BibTeX RDF	linear span, p-ary cascaded GMW sequence
51	Haruhiko Kaneko, Mariko Numakami, Eiji Fujiwara	Nonsystematic M-Ary Asymmetric Error Correcting Codes Designed by Multilevel Coding Method.	PRDC	2004	DBLP DOI BibTeX RDF	M-ary error control code, asymmetric error control code, multilevel coding method, confusion matrix, character recognition system
51	Baback A. Izadi, Füsun Özgüner	Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	spare allocation, augmented multiprocessor, wave switching, Fault tolerance, reconfiguration, hypercube, k-ary n-cube
51	MahnKi Ahn, JaeCheol Ha, Hoon-Jae Lee 0001, Sang-Jae Moon	A Random M-ary Method Based Countermeasure against Side Channel Attacks.	ICCSA (2)	2003	DBLP DOI BibTeX RDF	Random m-ary Recoding Algorithm, Side Channel Attacks, DPA, Elliptic Curve Cryptosystems, SPA, Power Analysis Attacks
51	Khaled Day, Abdel Elah Al-Ayyoub	Fault Diameter of k-ary n-cube Networks.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter
51	Yaagoub Ashir, Iain A. Stewart	Embeddings of cycles, meshes and tori in faulty k-ary n-cubes.	ICPADS	1997	DBLP DOI BibTeX RDF	cycles embedding, faulty k-ary n-cubes, meshes, hypercube networks, tori
51	Baback A. Izadi, Füsun Özgüner	Design of a Circuit-Switched Highly Fault-Tolerant k-ary n-cube.	ICPP	1997	DBLP DOI BibTeX RDF	augmented multiprocessor, spare allocation, Fault tolerance, reconfiguration, k-ary n-cube
51	Po-Jen Chuang, Chih-Ming Wu	Processor Allocation in k-ary n-cube Multiprocessors.	ISPAN	1997	DBLP DOI BibTeX RDF	Full subcube recognition, internal and external fragmentations, k-ary n-cube multiprocessors, performance evaluation, processor allocation
51	M. Ryu, Michitaka Kameyama	Design of a Highly Parallel Multiple-Valued Linear Digital System for k-Ary Operations Based on Extended Representation Matrices.	ISMVL	1995	DBLP DOI BibTeX RDF	highly parallel multiple-valued linear digital system, k-ary operations, extended representation matrices, minimum critical path delay, unary operations, sparse representation matrices, output digit, decomposed unary operations, delays, multivalued logic circuits, sparseness, superposition, code assignment, signal representation
48	Sundeep B, Andrew Thangaraj	Self-Orthogonality of q-Ary Images of qm-Ary Codes and Quantum Code Construction.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
48	Abu Sayed Md. Latiful Hoque	Storage and Querying of High Dimensional Sparsely Populated Data in Compressed Representation.	EurAsia-ICT	2002	DBLP DOI BibTeX RDF
44	Bin Yao, Haisen S. Li, Tian Zhou 0002, Baowei Chen	Theoretical Research on Topological Properties of Generalized K-Ary n-Cube Interconnection Network.	ICYCS	2008	DBLP DOI BibTeX RDF
44	Hassan Aly, Wilfried Meidl	On the Linear Complexity and k-Error Linear Complexity Over BBFp of the d-ary Sidel'nikov Sequence.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
44	Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison	N-Ary Queries by Tree Automata.	DBPL	2005	DBLP DOI BibTeX RDF	XML, databases, information extraction, pattern, logic, types, automata
44	Kazuhiko Iwasaki, Fumio Arakawa	An analysis of the aliasing probability of multiple-input signature registers in the case of a 2m-ary symmetric channel.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
44	Tae Nam Ahn, Kohichi Sakaniwa, T. R. N. Rao	A Construction Method for m-ary Unidirectional Error Control Codes.	AAECC	1990	DBLP DOI BibTeX RDF
43	Aminollah Mahabadi, Hamid Sarbazi-Azad, Ebrahim Khodaie, Keivan Navi	Parallel Lagrange interpolation on k -ary n -cubes with maximum channel utilization.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Link-disjoint Hamiltonian cycles, Parallel algorithms, Performance analysis, Interconnection networks, Multicomputers, k-ary n-cubes, Lagrange interpolation
43	Jin-Ho Chung, Kyeongcheol Yang	Design of M-Ary Low Correlation Zone Sequence Sets by Interleaving.	SETA	2008	DBLP DOI BibTeX RDF	low correlation zone (LCZ) sequences, quasi-synchronous code-division multiple access (QS-CDMA), M-ary sequences, interleaved sequences
43	Eric Filiol	Formalisation and implementation aspects of K -ary (malicious) codes.	J. Comput. Virol.	2007	DBLP DOI BibTeX RDF	Cohen model, k-ary malware, Detection problem, Metamorphism, Code interaction, Polymorphism
43	Samia Loucif, Mohamed Ould-Khaoua, Geyong Min	A queueing model for predicting message latency in uni-directional k -ary n -cubes with deterministic routing and non-uniform traffic.	Clust. Comput.	2007	DBLP DOI BibTeX RDF	M/G/1 queueing systems, Interconnection networks, Performance modelling, Hot spot, k-ary n-cubes, Deterministic routing
43	Jin-Ho Chung, Kyeongcheol Yang	Bounds on the Linear Complexity and the 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences.	SETA	2006	DBLP DOI BibTeX RDF	M-ary sequences, Sidel’nikov sequences, 1-error linear complexity, linear complexity
43	D. Doreen Hephzibah Miriam, T. Srinivasan 0001	A Fast and Efficient Isomorphic Task Allocation Scheme for K-Ary N-Cube Systems.	DIPES	2006	DBLP DOI BibTeX RDF	Full subcube recognition, k-ary n-cube systems, isomorphic partitioning, processor allocation
43	You-Chang Ko, Eui-Seok Hwang, Jeong-Jae Won, Hyong-Woo Lee, Choong-Ho Cho	Collision Reduction Random Access Using m-Ary Split Algorithm in Wireless Access Network.	WWIC	2005	DBLP DOI BibTeX RDF	m-ary split algorithm, Multimedia QoS, Random Access, Wireless Access Network
43	Baback A. Izadi, Füsun Özgüner	An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability.	J. Supercomput.	2004	DBLP DOI BibTeX RDF	k-ary tree, augmented multiprocessor, wave switching, fault tolerance, real time, reconfiguration
43	Limin Xiang, Kazuo Ushijima, Yuichi Asahiro	Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order.	ITCC	2002	DBLP DOI BibTeX RDF	coding $k$-ary trees, loopless generation, lexicographic order
43	Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie	Analytical Modeling of Wormhole-Routed k-Ary n-Cubes in the Presence of Hot-Spot Traffic.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	interconnection networks, performance modeling, wormhole routing, Multicomputers, hot-spot, k-ary n-cubes, message latency, nonuniform traffic, fully adaptive routing
43	Po-Jen Chuang, Chih-Ming Wu	An Efficient Recognition-Complete Processor Allocation Strategy for k-ary n-cube Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	Full subcube recognition, internal and external fragmentation, k-ary n-cube multiprocessors, performance evaluation, time complexity, processor allocation
43	Fabrizio Petrini, Marco Vanneschi	k -ary n -trees: High Performance Networks for Massively Parallel Architectures.	IPPS	1997	DBLP DOI BibTeX RDF	k-ary n-trees, flowcontrol, congestion-free patterns, routing, Interconnection networks, virtual channels, fat-trees
40	Sabrina Mantaci, Daniele Micciancio	An Algorithm for the Solution of Tree Equations.	TAPSOFT	1997	DBLP DOI BibTeX RDF
40	Pratul Dublish, S. N. Maheshwari	Expressibility of Bounded-Arity Fixed-Point Query Hierarchies.	PODS	1989	DBLP DOI BibTeX RDF
39	M. A. Sarwar, Alan D. George, David E. Collins	Reliability Modeling of SCI Ring-Based Topologies.	LCN	2000	DBLP DOI BibTeX RDF	SCI ring-based topologies, cluster interconnects, point-to-point ring-based interconnect, switched ring topologies, 1D k-ary n-cube switching fabrics, 2D k-ary n-cube switching fabrics, UltraSAN, single-ring system, redundant ring, fault tolerance, Petri nets, multiprocessor interconnection networks, network topology, reliability modeling, link failures, system buses, multiprocessor interconnects, scalable coherent interface
36	Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner	k-ary search on modern processors.	DaMoN	2009	DBLP DOI BibTeX RDF
36	Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung	New Families of M-Ary Sequences With Low Correlation Constructed From Sidel'nikov Sequences.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
36	Marc Mouffron	Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications.	WAIFI	2008	DBLP DOI BibTeX RDF	(sharply) t-transitive functions, balanced functions, functions over finite fields, hardware and software implementation, Symmetric functions
36	Yang Wang 0014, Hung Q. Ngo 0001, Xiaohong Jiang 0001	Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints.	ICC	2008	DBLP DOI BibTeX RDF
36	Ji-Woong Jang, Jong-Seon No, Habong Chung, Xiaohu Tang	New Sets of Optimal p-ary Low-Correlation Zone Sequences.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
36	Arnon Avron, Anna Zamansky	Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers.	LFCS	2007	DBLP DOI BibTeX RDF
36	Hongmei Liu 0002	The Pancyclicity of m-ary n-cube Networks.	ICNSC	2007	DBLP DOI BibTeX RDF
36	Lionel Paris, Belaid Benhamou, Pierre Siegel	A Boolean Encoding Including SAT and n-ary CSPs.	AIMSA	2006	DBLP DOI BibTeX RDF	Logic and constraint programming, Automated reasoning, Knowledge representation and reasoning
36	Toshinori Yamada, Hiroyuki Kawakita, Tadashi Nishiyama, Shuichi Ueno	On VLSI decompositions for d-ary de Bruijn graphs (extended abstract).	ISCAS (2)	2005	DBLP DOI BibTeX RDF
36	Wen Hu, Guoxin Zheng	Orthogonal Hermite Pulses Used for UWB M-ary Communication.	ITCC (1)	2005	DBLP DOI BibTeX RDF
36	Deqiang Wang, Mingyang Pan, Tong An, Kelun Wang, Shuyan Qu	Hamiltonian-like Properties of k-Ary n-Cubes.	PDCAT	2005	DBLP DOI BibTeX RDF
36	Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Angèle M. Hamel, Tommi S. Jaakkola, Nathan Srebro	K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data.	WABI	2002	DBLP DOI BibTeX RDF
36	Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie	Performance Analysis of k-Ary n-Cubes with Fully Adaptive Routing.	ICPADS	2000	DBLP DOI BibTeX RDF	Interconnection Networks, Parallel Architectures, Performance Modeling, Wormhole Routing, Multicomputers, Virtual Channels, Message Latency, Fully-Adaptive Routing
36	Yuanlin Zhang 0002, Roland H. C. Yap	Arc Consistency on n-ary Monotonic and Linear Constraints.	CP	2000	DBLP DOI BibTeX RDF
36	Parameswaran Ramanathan, Suresh Chalasani	Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
35	Sun-Yuan Hsieh, Tsong-Jie Lin, Hui-Ling Huang	Panconnectivity and edge-pancyclicity of 3-ary N -cubes.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	Panconnectivity, Edge-pancyclicity, Hypercubes, k-ary n-cubes, Graph-theoretic interconnection networks
35	Tor Helleseth, Alexander Kholosha	On the Dual of Monomial Quadratic p -ary Bent Functions.	SSC	2007	DBLP DOI BibTeX RDF	p-ary bent function, dual function, regularity, exponential sum
35	D. Doreen Hephzibah Miriam, T. Srinivasan 0001, R. Deepa 0001	An Efficient SRA Based Isomorphic Task Allocation Scheme for k - ary n - cube Massively Parallel Processors.	PARELEC	2006	DBLP DOI BibTeX RDF	Full subcube recognition, k-ary n-cube systems, isomorphic partitioning, processor allocation
35	Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S. Mukherjee	Exploiting Global Knowledge to Achieve Self-Tuned Congestion Control for k-Ary n-Cube Networks.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF	k{hbox{-}rm ary}n{hbox{-}rm cubes}, Interconnection networks, congestion control, self-tuning, wormhole, global information
35	Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles	Adaptive channel queue routing on k-ary n-cubes.	SPAA	2004	DBLP DOI BibTeX RDF	adaptive channel queue routing, k-ary n-cubes
35	Myung M. Bae, Bella Bose	Edge Disjoint Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Lee distance Gray codes, binary Gray codes, hypercube, Hamiltonian cycle, k-ary n-cubes, Lee distance
35	Sylvain Pion, Chee-Keng Yap	Constructive root bound for k-ary rational input numbers.	SCG	2003	DBLP DOI BibTeX RDF	constructive root bounds, k-ary rational numbers, robust numerical algorithms, exact geometric computation
35	Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua	Probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes.	SAC	2002	DBLP DOI BibTeX RDF	performance analysis, probability, multicomputers, fault-tolerant routing, k-Ary n-Cubes
35	Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua	A New Probabilistic Approach for Fault-Tolerant Routing in k-Ary n-Cubes.	ICPADS	2002	DBLP DOI BibTeX RDF	Performance Evaluation, Interconnection Networks, Multicomputers, Fault-Tolerant Routing, k-Ary n-Cube
35	Satoshi Fujita	Worst Case Analysis of a Greedy Multicast Algorithm in k-ary n-cubes.	ICPP	2002	DBLP DOI BibTeX RDF	analysis of algorithms, information dissemination, k-ary n-cube, multicast tree, approximation ratio
35	Timothy Mark Pinkston, Sugath Warnakulasuriya	Characterization of Deadlocks in k-ary n-Cube Networks.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	Deadlock characterization, true fully adaptive routing, $k$-ary $n$-cube interconnection networks, deadlock detection, deadlock recovery
35	Dhabaleswar K. Panda 0001, Sanjay Singal, Ram Kesavan	Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	deadlock-freedom and interprocessor communication, multicast, interconnection networks, broadcast, meshes, Wormhole routing, collective communication, k-ary n-cubes
35	Ram Kesavan, Dhabaleswar K. Panda 0001	Multiple Multicast with Minimized Node Contention on Wormhole k-ary n-cube Networks.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	$k$-ary $n$-cube, unicast and multidestination message passing, multicast, broadcast, meshes, wormhole routing, Collective communication, path-based routing
35	Debashis Basak, Dhabaleswar K. Panda 0001	Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	consumption channel, hot-spot traffic and interprocessor communication, wormhole routing, adaptive routing, virtual channel, k-ary n-cube, Parallel computer architecture, deterministic routing
35	Jan Trdlicka, Pavel Tvrdík	Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori.	Euro-Par	1997	DBLP DOI BibTeX RDF	complete k-ary tree, 2-dimensional square mesh, embedding problem, dilation, expansion, load
35	J. C. Tay, S. Y. Huang, Hiok Chai Quek	CSL (Part II): Modelling General N-ary, Logical CSPs.	ICTAI	1997	DBLP DOI BibTeX RDF	CSL algebra, constraint specification language, n-ary logical constraint satisfaction problem, executable data structures, binary CSP algorithms, design, compiler, implementation, constraint handling
35	Mongkol Raksapatcharawong, Timothy Mark Pinkston	An Optical Interconnect Model for k-ary n-cube Wormhole Networks.	IPPS	1996	DBLP DOI BibTeX RDF	free-space optical interconnects, optical interconnect model, performance evaluation, wormhole switching, k-ary n-cube networks
35	C. S. Yang, Y. M. Tsai, Y. L. Tsai	Adaptive routing in k-ary n-cube multicomputers.	ICPADS	1996	DBLP DOI BibTeX RDF	k-ary n-cube multicomputers, distributed memory multiprocessor systems, virtual system, network congestion delay, performance evaluation, virtual reality, throughput, hypercube networks, wormhole routing, digital simulation, adaptive routing, distributed memory systems, simulation results, network routing, buffer size, deadlock-free routing, deadlock free routing, communication latency
35	Dhabaleswar K. Panda 0001	Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms.	IPPS	1995	DBLP DOI BibTeX RDF	global reduction, wormhole k-ary n-cube networks, multidestination exchange worms, multidestination message passing mechanism, pairwise exchange worms, complete global reduction, barrier synchronization operations, message passing interface standard, unicast-based message passing, communication startup time, data size, fast global reduction, message passing, synchronisation, hypercube networks, system size
35	Chatschik Bisdikian	Throughput behavior of the n-ary stack algorithm in mobile networks with capture.	LCN	1995	DBLP DOI BibTeX RDF	n-ary stack algorithm, random access protocols, random access schemes, limited sensing, stack algorithms, performance evaluation, wireless LAN, mobile networks, access protocols, packet radio networks
35	Steven L. Scott, James R. Goodman	The Impact of Pipelined Channels on k-ary n-Cube Networks.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	pipelined channels, bisection constraints, optimaldimensionality, pipelined-channel networks, switching overhead, performance evaluation, multiprocessor interconnection networks, pipeline processing, cycle time, k-ary n-cube networks, message lengths
32	Tomás Werner	High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF).	CVPR	2008	DBLP DOI BibTeX RDF
32	Ge Li, Ivan J. Fair, Witold A. Krzymien	Low-density parity-check codes for space-time wireless transmission.	IEEE Trans. Wirel. Commun.	2006	DBLP DOI BibTeX RDF
32	Tiziana Ligorio, Susan L. Epstein	Partial Redundant Modeling.	CP	2005	DBLP DOI BibTeX RDF
32	Magdalena Punceva, Karl Aberer	Trust-Aware Delivery of Composite Goods.	DBISP2P	2003	DBLP DOI BibTeX RDF
32	Jeff Z. Pan, Ian Horrocks 0001	Extending Datatype Support in Web Ontology Reasoning.	OTM	2002	DBLP DOI BibTeX RDF
32	Alexandr Y. Lev, Yuliy A. Lev, Vyacheslav N. Okhrymenko	Non-binary Block Inseparable Errors Control Codes.	IMACC	2001	DBLP DOI BibTeX RDF
32	Frank Ruskey, Joe Sawada	Generating Necklaces and Strings with Forbidden Substrings.	COCOON	2000	DBLP DOI BibTeX RDF
32	Karel Culík II, Thomas Ottmann, Derick Wood	Dense Multiway Trees.	ACM Trans. Database Syst.	1981	DBLP DOI BibTeX RDF	dense trees, multiway trees, storage utilization, B-trees, search trees, balanced trees
31	Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison	Polynomial time fragments of XPath with variables.	PODS	2007	DBLP DOI BibTeX RDF	N-ary queries, XML, logic, XPath
31	Rajoo Pandey	Feedforward neural network for blind equalization with PSK signals.	Neural Comput. Appl.	2005	DBLP DOI BibTeX RDF	Complex-valued nonlinear activation functions, M-ary PSK signals, CMA cost function, Neural networks, Blind equalization
31	Helen Xie, Philip Henderson, Joseph Neelamkavil, Jingxin Li	A Systematic Search Strategy for Product Configuration.	IEA/AIE	2004	DBLP DOI BibTeX RDF	numeric variables, n-ary constraints, dependent variables, backjumping, Constraint satisfaction, variable ordering, product configuration
31	Nieves R. Brisaboa, Eva Lorenzo Iglesias, Gonzalo Navarro 0001, José R. Paramá	An Efficient Compression Code for Text Databases.	ECIR	2003	DBLP DOI BibTeX RDF	D-ary Huffman coding, Text compression, text databases
31	Colin D. Walter, Susan Thompson	Distinguishing Exponent Digits by Observing Modular Subtractions.	CT-RSA	2001	DBLP DOI BibTeX RDF	m-ary method, power analysis, sliding windows, Exponentiation, Montgomery multiplication, modular multiplication, timing attack, RSA cryptosystem
31	Debashis Basak, Dhabaleswar K. Panda 0001	Designing Clustered Multiprocessor Systems under Packaging and Technological Advancements.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	k-ary n-cube interconnection, packaging constraints, interconnection networks, parallel architectures, Multiprocessor systems, clustered architectures, hierarchical organization, scalable systems