Search results for "Bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
20	Daniel Yuh Chao	Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound.	ICA3PP	2009	DBLP DOI BibTeX RDF	iteration bound, Petri nets, Data Flow Graph (DFG), Concurrent Processing
20	Rua-Huan Tsaih, Yat-wah Wan	A Guide for the Upper Bound on the Number of Continuous-Valued Hidden Nodes of a Feed-Forward Network.	ICANN (1)	2009	DBLP DOI BibTeX RDF	single-hidden layer feed-forward neural network, parity problem, Bound, preimage, hidden nodes
20	Francis Sourd, Safia Kedad-Sidhoum	A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem.	J. Sched.	2008	DBLP DOI BibTeX RDF	One-machine scheduling, Earliness-tardiness, Branch-and-bound, Lagrangean relaxation
20	Jakob Puchinger, Peter J. Stuckey	Automating branch-and-bound for dynamic programs.	PEPM	2008	DBLP DOI BibTeX RDF	dynamic programming, branch and bound, automatic transformation
20	Uk-Pyo Han, Gil-Mo Yang, Jae-Soo Yoo, Young-Jun Chung, Hee-Choon Lee	A Proposal on the Error Bound of Collaborative Filtering Recommender System.	MUE	2008	DBLP DOI BibTeX RDF	Recommender system, Collaborative filtering, Error bound
20	Minmin Shen, Ping Xue 0001, Ci Wang	The Influence of Regularization Parameter on Error Bound in Super-Resolution Reconstruction.	PCM	2008	DBLP DOI BibTeX RDF	regularization, super-resolution, Error bound
20	Xiaoguang Yang, Jianzhong Zhang 0001	Some inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Inverse min-max network problem, Weighted l 1 norm, Weighted l? norm, Bound constraints, Polynomial time algorithms
20	Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi	A Grid-based Parallel Approach of the Multi-Objective Branch and Bound.	PDP	2007	DBLP DOI BibTeX RDF	Grid Computing, Multi-Objective Optimization, Branch and Bound
20	David Lefranc, Philippe Painchault, Valérie Rouat, Emmanuel Mayer	A Generic Method to Design Modes of Operation Beyond the Birthday Bound.	Selected Areas in Cryptography	2007	DBLP DOI BibTeX RDF	PRP, PRF, birthday bound, CENC, modes of operation, symmetric encryption, counter mode
20	Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede	Iteration Bound Analysis and Throughput Optimum Architecture of SHA-256 (384, 512) for Hardware Implementations.	WISA	2007	DBLP DOI BibTeX RDF	SHA-256 (384,512), Iteration Bound Analysis, Throughput Optimum Architecture
20	Mustafa M. Tikir, Laura Carrington, Erich Strohmaier, Allan Snavely	A genetic algorithms approach to modeling the performance of memory-bound computations.	SC	2007	DBLP DOI BibTeX RDF	cache bandwidth, memory bound applications, genetic algorithms, machine learning, performance modeling and prediction
20	Mathias Péron, Nicolas Halbwachs	An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints.	VMCAI	2007	DBLP DOI BibTeX RDF	difference-bound matrices, disequalities, static analysis, alias analysis, abstract domains
20	Zdenek Dostál	An Optimal Algorithm for Bound and Equality Constrained Quadratic Programming Problems with Bounded Spectrum.	Computing	2006	DBLP DOI BibTeX RDF	bound and equality constraints, optimal algorithms, Quadratic programming, augmented Lagrangians
20	João Fradinho Oliveira, Bernard F. Buxton	PNORMS: platonic derived normals for error bound compression.	VRST	2006	DBLP DOI BibTeX RDF	colour compression, normal compression, run-time encoding, error bound
20	Zhaohui Fu, Sharad Malik	Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search.	ICCAD	2006	DBLP DOI BibTeX RDF	MinCostSAT, optimization, branch-and-bound, Boolean satisfiability
20	E. J. Cheon, Takao Kato, Seon Jeong Kim	Nonexistence of [n, 5, d]q Codes Attaining the Griesmer Bound for q4-2q2-2q+1 <= d <= q4-2q2-q.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	projective code, linear code, projective space, Griesmer bound
20	Jeff T. Linderoth	A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs.	Math. Program.	2005	DBLP DOI BibTeX RDF	Nonconvex quadratic programming, Global optimization, Branch-and-bound, Convex envelope
20	H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove	Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs.	J. Sched.	2005	DBLP DOI BibTeX RDF	set-up time, scheduling, branch and bound, families, batches, single machine
20	Roberto Andreani, Ana Friedlander	Bound Constrained Smooth Optimization for Solving Variational Inequalities and Related Problems.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	bound constrained optimization, variational inequalities, merit functions
20	Larry J. Stockmeyer, Albert R. Meyer	Cosmological lower bound on the circuit complexity of a small problem in logic.	J. ACM	2002	DBLP DOI BibTeX RDF	WS1S, practical undecidability, computational complexity, lower bound, logic, Circuit complexity, decision problem
20	Guo-Hui Lin, Dong Xu 0002, Zhi-Zhong Chen, Tao Jiang 0001, Jianjun Wen, Ying Xu 0001	An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks.	CSB	2002	DBLP DOI BibTeX RDF	chemical shift, peak assignment, combinatorial technique, branch-and-bound, greedy algorithm, protein structure, bipartite matching, NMR
20	Peter R. Cappello, Ömer Egecioglu	Automatic Processor Lower Bound Formulas for Array Computations.	ISPAN	2002	DBLP DOI BibTeX RDF	Array computation, Diophantine system, lower bound
20	Christophe Genolini, Sébastien Tixeuil	A Lower Bound on Dynamic k-Stabilization in Asynchronous Systems.	SRDS	2002	DBLP DOI BibTeX RDF	Dynamic problems, Lower bound, Self-stabilization, Asynchronous systems, Transient failures, Time adaptivity
20	Micha Sharir, Emo Welzl	Balanced lines, halving triangles, and the generalized lower bound theorem.	SCG	2001	DBLP DOI BibTeX RDF	$k$-sets, Gale transform, Lovasz Lemma, balanced lines, generalized lower bound theorem, halving triangles
20	Myung K. Yang, Chita R. Das	A Parallel Optimal Branch-and-Bound Algorithm for MIN-Based Multiprocessors.	ICPP	1999	DBLP DOI BibTeX RDF	MIN-based multiprocessor systems, Simulation, Analysis, Computation time, Branch-and-Bound algorithm, Communication time
20	Yinan N. Shen, Xiao-Tao Chen, Susumu Horiguchi, Fabrizio Lombardi	On the multiple fault diagnosis of multistage interconnection networks: the lower bound and the CMOS fault model.	ICPP	1997	DBLP DOI BibTeX RDF	CMOS fault model, multiple fault diagnosis, interconnection networks, fault diagnosis, lower bound, multistage interconnection networks, multistage interconnection networks, CMOS technology, stuck-open faults
20	Christer Berg, Staffan Ulfberg	A Lower Bound for Perceptrons and an Oracle Separation of the PPPH Hierarchy.	CCC	1997	DBLP DOI BibTeX RDF	oracle separation, PP/sup PH/ hierarchy, linear size boolean circuits, superpolynomial size perceptrons, lower bound, Boolean functions, perceptrons
20	Kanad Ghose, Kiran Raghavendra Desai, Peter M. Kogge	Using Method Lookup Caches and Register Windowing to Speed Up Dynamically-Bound Object-Oriented Applications.	EUROMICRO	1996	DBLP DOI BibTeX RDF	method lookup caches, dynamically-bound object-oriented applications, logical reference, method binding, context allocation, contemporary pipelined datapath, detailed register level simulation, object-oriented programming, object oriented programming languages, register windowing
20	Gintaras Palubeckis	A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming.	Computing	1995	DBLP DOI BibTeX RDF	Integer quadratic programming, graphs, branch and bound
20	Myung K. Yang, Chita R. Das	Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	parallel branch-and-bound algorithm, MIN-based multiprocessorsystems, serial best-first search, conflict-free mapping scheme, performance evaluation, parallel algorithms, multiprocessor interconnection networks, multiprocessing systems, probabilistic model, communication overheads, computation overheads
20	Byeungwoo Jeon, David A. Landgrebe	Fast Parzen Density Estimation Using Clustering-Based Branch and Bound.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	fast Parzen density estimation, clustering-based branch and bound, nonparametric discriminant analysis, multivariant case, data reduction technique, pattern recognition, estimation theory, kernel functions, nonparametric statistics, computational load, data samples
20	F. Körner	An efficient branch and bound algorithm to solve the quadratic integer programming problem.	Computing	1983	DBLP DOI BibTeX RDF	Integer quadratic programming, branch and bound
19	Matei David, Periklis A. Papakonstantinou	Trade-Off Lower Bounds for Stack Machines.	CCC	2010	DBLP DOI BibTeX RDF	AuxPDA, lower bound, streaming, communication complexity, stack, reversals, space bound
19	Hyunwoo Jung, Kyung-Yong Chwa	The Balloon Popping Problem Revisited: Lower and Upper Bounds.	SAGT	2009	DBLP DOI BibTeX RDF	lower bound, auction, upper bound
19	Karl Schnaitter, Neoklis Polyzotis	Evaluating rank joins with optimal cost.	PODS	2008	DBLP DOI BibTeX RDF	feasible-region bound, pbrj, rank join, ranking query optimization, tight bound
19	Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap	Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves.	ISSAC	2008	DBLP DOI BibTeX RDF	complete numerical algorithm, evaluation bound, implicit algebraic curve, root bound, meshing, singularity, subdivision algorithm
19	Hoang Tuy	On a decomposition method for nonconvex global optimization.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Nonconvex global optimization, Partly convex, Partly monotonic, Monotonic/linear problems, Branch and bound decomposition algorithm, Lagrangian bound, Convergence conditions, Parametric optimization, Duality gap
19	Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap	Complete numerical isolation of real zeros in zero-dimensional triangular systems.	ISSAC	2007	DBLP DOI BibTeX RDF	evaluation bound, real zero isolation, sleeve bound, triangular system
19	Liang-Liang Xie, Panganamala R. Kumar	On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	capacity of wireless networks, cut-set bound, max-flow min-cut bound, multiuser information theory, ad hoc networks, wireless networks, scaling laws, transport capacity, network information theory
19	Henrik Lipskoch, Karsten Albers, Frank Slomka	Battery discharge aware energy feasibility analysis.	CODES+ISSS	2006	DBLP DOI BibTeX RDF	demand bound function, energy bound function, power consumption, spice, battery modeling, event stream
19	K. H. (Kane) Kim	Timeliness Assurance via Hybrid Approaches during Design of Distributed Embedded Computing Systems.	WORDS Fall	2003	DBLP DOI BibTeX RDF	service time bound, statistical derivation, analytical derivation, soft-firm bound, real time, certification, object, TMO, embedded computing, timeliness, hybrid approach, guarantee
19	Marek Chrobak, Leszek Gasieniec, Wojciech Rytter	Fast Broadcasting and Gossiping in Radio Networks.	FOCS	2000	DBLP DOI BibTeX RDF	radio broadcasting, fast broadcasting algorithm, deterministic distributed broadcasting, lower bound, network topology, network topology, time complexity, communication complexity, upper bound, gossiping, deterministic algorithms, radio networks, multi-hop radio networks
19	Arie Harel, Su Namn, Jacob Sturm	Simple bounds for closed queueing networks.	Queueing Syst. Theory Appl.	1999	DBLP DOI BibTeX RDF	balanced job bounds, complete symmetric function, mean performance measures, lower bound, throughput, upper bound, majorization, closed queueing networks, normalization constant
19	Lars Arge, Jeffrey Scott Vitter	Optimal Dynamic Interval Management in External Memory (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	optimal dynamic interval management, space-optimal external-memory data structure, I/O-optimal external-memory data structure, stabbing query answering, dynamically maintained intervals, I/O algorithms, 2D range searching, optimal linear space, optimal I/O query bound, optimal I/O update bound, worst-case update bounds, balancing technique, worst-case balanced tree manipulation, databases, object-oriented databases, temporal databases, storage management, constraint logic programming, external memory
19	Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan 0001	Linearity Testing in Characteristic Two.	FOCS	1995	DBLP DOI BibTeX RDF	characteristic two, relative distance, rejection probability, Max3SAT, MaxSNP problems, lower bounds, lower bound, probability, theorem proving, upper bound, homomorphisms, Fourier analysis, Fourier analysis, linearity testing, linear functions
19	Noam Nisan, Steven Rudich, Michael E. Saks	Products and Help Bits in Decision Trees	FOCS	1994	DBLP DOI BibTeX RDF	help bits, k-tuple, parallel decision tree algorithms, fixed depth bound, maximum fraction, arbitrary binary questions, complexity, lower bound, decision trees, multivariate polynomial
19	Bernard Chazelle	A Spectral Approach to Lower Bounds	FOCS	1994	DBLP DOI BibTeX RDF	median eigenvalue, nonlinear lower bound, halfplane range searching, nontrivial lower bound, linear circuit complexity, linear map, geometric set system, lower bounds, range searching
19	Greg Barnes, Jeff Edmonds	Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	directed s-t connectivity, JAG models, s-t connectivity, distinguished vertex, time-space lower bound, directed graph, upper bound
19	Lavinia Egidi	The Complexity of the Theory of p-adic Numbers	FOCS	1993	DBLP DOI BibTeX RDF	elementary upper bound, p-adic numbers, double exponential alternating time, double exponential space, cell decomposition, complexity, lower bound, decision problem, semi-algebraic sets
19	Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam 0001	Directed vs. Undirected Monotone Contact Networks for Threshold Functions	FOCS	1993	DBLP DOI BibTeX RDF	Boolean functions complexity, monotone contact networks, almost optimal, lower bound, upper bound, threshold functions
19	Mohammed Atiquzzaman, W. H. Shehadah	A Microprocessor-Based Office Image Processing System-An Extension of Work.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	microprocessor-based office image processing system, compute-bound, I/O-bound state, image input time, computerised picture processing
19	Peter Bro Miltersen, Mike Paterson, Jun Tarui	The Asymptotic Complexity of Merging Networks	FOCS	1992	DBLP DOI BibTeX RDF	merging networks, monotone Boolean circuits, lower bound, permutations, upper bound, switching networks, comparators, comparator network, asymptotic complexity
19	Amotz Bar-Noy, David Peleg	Square Meshes are not always Optimal.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	broadcast facilities, rows, columns, two-dimensional rectangular mesh, skewed rectangular mesh, parallel architectures, upper bound, tight bound, mesh connected computers, semigroup computations, multiple buses
19	Anja Feldmann, Jirí Sgall, Shang-Hua Teng	Dynamic Scheduling on Parallel Machines	FOCS	1991	DBLP DOI BibTeX RDF	fixed-dimensional meshes, online job scheduling, lower bound proof, parallel architectures, parallel machines, upper bound, dynamic scheduling
19	Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa	Time-Space Tradeoffs for Undirected Graph Traversal	FOCS	1990	DBLP DOI BibTeX RDF	jumping automata, undirected graph traversal, quadratic lower bound, probabilistic upper bound, time-space tradeoff, deterministic model
19	Wolfgang Maass 0001, György Turán	On the Complexity of Learning From Counterexamples (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	combinatorial invariants, complexity of learning, d-dimensional discrete space, lower bound, upper bound, finite domain
19	Hisao Kameda	Optimality of a Central Processor Scheduling Policy for Processing a Job Stream	ACM Trans. Comput. Syst.	1984	DBLP DOI BibTeX RDF	1/0 bound, CPU bound, Markovian queuing model, dispatching policy, finite-source queue, job stream, machine repairman model, multiple-resource system, near-complete decomposability, multiprogramming, CPU scheduling, preemptive priority
19	Benjamin W. Wah, Y. W. Eva Ma	MANIP - A Multicomputer Architecture for Solving Combinatorial Extremum-Search Problems.	IEEE Trans. Computers	1984	DBLP DOI BibTeX RDF	Approximate branch-and-bound, parallel branch-and-bound, vertex-covering problem, selection, virtual memory, NP-hard problems, ring network
19	Marc Glisse, Sylvain Lazard	On the complexity of sets of free lines and line segments among balls in three dimensions.	SCG	2010	DBLP DOI BibTeX RDF	3D visibility, free lines, free segments, visibility complex, balls
19	Guowen Han, Yuanyuan Yang 0001	Scheduling and performance analysis of multicast interconnects.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	Quality-of-service (QoS), Approximation algorithms, Multicast, Interconnects, Scheduling algorithms, Random graph, Conflict graph
19	Monique Laurent	Strengthened semidefinite programming bounds for codes.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C27, 90C22, 94B65, 05E20
19	Qi Wu 0002, Yongqiang Xiong, Qian Zhang 0001, Zihua Guo, Xiang-Gen Xia 0001, Zhongcheng Li	Joint routing and topology formation in multihop UWB networks.	IEEE J. Sel. Areas Commun.	2006	DBLP DOI BibTeX RDF
19	Vignesh Sethuraman, Bruce E. Hajek	Comments on "Bit-interleaved coded modulation".	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
19	Andris Ambainis, Daniel Gottesman	The minimum distance problem for two-way entanglement purification.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
19	Gudmund Skovbjerg Frandsen, Peter Frands Frandsen	Dynamic Matrix Rank.	ICALP (1)	2006	DBLP DOI BibTeX RDF
19	Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis	The Impact of Network Structure on the Stability of Greedy Protocols.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
19	Boris Aronov, Vladlen Koltun, Micha Sharir	Incidences between points and circles in three and higher dimensions.	SCG	2002	DBLP DOI BibTeX RDF	three dimensions, combinatorial geometry, incidences, circles
19	Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri	Selective families, superimposed codes, and broadcasting on unknown radio networks.	SODA	2001	DBLP BibTeX RDF
19	Parampalli Udaya, Serdar Boztas	On the Aperiodic Correlation Function of Galois Ring m-Sequences.	AAECC	2001	DBLP DOI BibTeX RDF	Quadriphase sequences, Aperiodic correlations, Gauss sums over Galois rings, Galois Rings
19	Markus Bläser	Computing Reciprocals of Bivariate Power Series.	MFCS	2001	DBLP DOI BibTeX RDF
19	Liam Keliher, Henk Meijer, Stafford E. Tavares	New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.	EUROCRYPT	2001	DBLP DOI BibTeX RDF	substitution-permutation networks, maximum average linear hull probability, provable security, linear cryptanalysis
19	Jürgen Forster, Matthias Krause 0001, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon	Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.	FSTTCS	2001	DBLP DOI BibTeX RDF
18	Marina V. Kondratieva, Alexander V. Mikhalev, E. V. Pankratiév	Jacobi's bound for independent systems of algebraic partial differential equations.	Appl. Algebra Eng. Commun. Comput.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 12H05
18	Yang Cai 0001, Ting Zhang, Haifeng Luo	An Improved Lower Bound for the Complementation of Rabin Automata.	LICS	2009	DBLP DOI BibTeX RDF
18	Thomas Colcombet, Konrad Zdanowski	A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.	ICALP (2)	2009	DBLP DOI BibTeX RDF
18	Lei Jia, Shizhong Liao	Accurate Probabilistic Error Bound for Eigenvalues of Kernel Matrix.	ACML	2009	DBLP DOI BibTeX RDF
18	Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi, Mohammed J. Zaki	Clustering with Lower Bound on Similarity.	PAKDD	2009	DBLP DOI BibTeX RDF
18	Daniel Enrique Lucani, Muriel Médard, Milica Stojanovic	Underwater Acoustic Networks: Channel Models and Network Coding Based Lower Bound to Transmission Power for Multicast.	IEEE J. Sel. Areas Commun.	2008	DBLP DOI BibTeX RDF
18	Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Maja Loncar	An Improved Bound on the List Error Probability and List Distance Properties.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
18	Christian Blum 0001, Carlos Cotta, Antonio J. Fernández 0001, José E. Gallardo, Monaldo Mastrolilli	Hybridizations of Metaheuristics With Branch & Bound Derivates.	Hybrid Metaheuristics	2008	DBLP DOI BibTeX RDF
18	Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir	A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding.	DCC	2008	DBLP DOI BibTeX RDF	Complexity, Delay, Redundancy, Source coding, Precision, Arithmetic coding
18	Martin Paluszewski, Pawel Winter	Protein Decoy Generation Using Branch and Bound with Efficient Bounding.	WABI	2008	DBLP DOI BibTeX RDF
18	Aaron B. Wagner	An outer bound for distributed compression of linear functions.	CISS	2008	DBLP DOI BibTeX RDF
18	Christian Schellewald	A Bound for Non-subgraph Isomorphism.	GbRPR	2007	DBLP DOI BibTeX RDF
18	Adam R. Klivans, Alexander A. Sherstov	A Lower Bound for Agnostically Learning Disjunctions.	COLT	2007	DBLP DOI BibTeX RDF
18	Pramod Lakshmi Narasimha, Michael T. Manry, Francisco Maldonado	Upper Bound on Pattern Storage in Feedforward Networks.	IJCNN	2007	DBLP DOI BibTeX RDF
18	Cédric Pessan, Jean-Louis Bouquard, Emmanuel Néron	Genetic Branch-and-Bound or Exact Genetic Algorithm?.	Artificial Evolution	2007	DBLP DOI BibTeX RDF
18	Theo G. Swart, Hendrik C. Ferreira	A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
18	Yahya Z. Mohasseb, Michael P. Fitz, Urbashi Mitra	An improved bound on the performance of maximum-likelihood multiuser detection receivers in Rayleigh fading.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
18	Thomas Svantesson, A. Lee Swindlehurst	A performance bound for prediction of MIMO channels.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
18	Songtao Guo, Xintao Wu, Yingjiu Li	On the Lower Bound of Reconstruction Error for Spectral Filtering Based Privacy Preserving Data Mining.	PKDD	2006	DBLP DOI BibTeX RDF
18	Alexis Maciel, Toniann Pitassi	Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives.	LICS	2006	DBLP DOI BibTeX RDF
18	Alexander A. Razborov, Sergey Yekhanin	An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval.	FOCS	2006	DBLP DOI BibTeX RDF
18	Uli Wagner 0001	On a Geometric Generalization of the Upper Bound Theorem.	FOCS	2006	DBLP DOI BibTeX RDF
18	Krzysztof Pietrzak	A Tight Bound for EMAC.	ICALP (2)	2006	DBLP DOI BibTeX RDF
18	Fuye Feng, Yong Xia, Quanju Zhang	A Recurrent Neural Network for Linear Fractional Programming with Bound Constraints.	ISNN (1)	2006	DBLP DOI BibTeX RDF
18	Beate Bollig, Philipp Woelfel	A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
18	Jun Saiki, Hirofumi Miyatsuji	Limitation of Maintenance of Feature-Bound Objects in Visual Working Memory.	BVAI	2005	DBLP DOI BibTeX RDF
18	Petr Somol, Pavel Pudil, Josef Kittler	Fast Branch & Bound Algorithms for Optimal Feature Selection.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF
18	Beate Bollig, Philipp Woelfel	A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.	MFCS	2002	DBLP DOI BibTeX RDF