Search results for "arbitrary"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Hui Li 0005, Qiting Yang, Jiangtao Cui	a2RegInf: An Interactive System for Maximizing Influence within Arbitrary Number of Arbitrary Shaped Query Regions.	WSDM	2022	DBLP DOI BibTeX RDF
16	Mack Kenamond, Dmitri Kuzmin, Mikhail J. Shashkov	Intersection-distribution-based remapping between arbitrary meshes for staggered multi-material arbitrary Lagrangian-Eulerian hydrodynamics.	J. Comput. Phys.	2021	DBLP DOI BibTeX RDF
16	Nobuto Hirakoso, Ryoichiro Tamura, Yoichi Shigematsu	Study on Arbitrary Direction Navigation System for Autonomous Multirotor with Arbitrary Configuration of Rotors.	J. Robotics Mechatronics	2020	DBLP DOI BibTeX RDF
16	Zhuo-Heng He	Sylvester-type quaternion matrix equations with arbitrary equations and arbitrary unknowns.	CoRR	2020	DBLP BibTeX RDF
16	Marcel Campen, Hanxiao Shen, Jiaran Zhou, Denis Zorin	Seamless Parametrization with Arbitrary Cones for Arbitrary Genus.	ACM Trans. Graph.	2020	DBLP DOI BibTeX RDF
16	Hee-Ran Ahn, Manos M. Tentzeris	Compact and Wideband General Coupled-Line Ring Hybrids (GCRHs) for Arbitrary Circumferences and Arbitrary Power-Division Ratios.	IEEE Access	2019	DBLP DOI BibTeX RDF
16	Wei-Jun Chen	Efficient Mean/Sigma Estimation at Arbitrary Spatial Positions with Arbitrary Scales within A 2D Image.	SITIS	2019	DBLP DOI BibTeX RDF
16	Rajai Nasser, Joseph M. Renes	Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs.	IEEE Trans. Inf. Theory	2018	DBLP DOI BibTeX RDF
16	Felix Horger, Tobias Würfl, Vincent Christlein, Andreas K. Maier	Towards Arbitrary Noise Augmentation - Deep Learning for Sampling from Arbitrary Probability Distributions.	MLMIR@MICCAI	2018	DBLP DOI BibTeX RDF
16	Rajai Nasser, Joseph M. Renes	Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs.	CoRR	2017	DBLP BibTeX RDF
16	Zhao-Hong Jia, Xiaohao Li, Joseph Y.-T. Leung	Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities.	Future Gener. Comput. Syst.	2017	DBLP DOI BibTeX RDF
16	Rajai Nasser, Joseph M. Renes	Polar codes for arbitrary classical-quantum channels and arbitrary cq-MACs.	ISIT	2017	DBLP DOI BibTeX RDF
16	Samuel Leweke, Eric von Lieres	Fast arbitrary order moments and arbitrary precision solution of the general rate model of column liquid chromatography with linear isotherm.	Comput. Chem. Eng.	2016	DBLP DOI BibTeX RDF
16	Rajai Nasser, Emre Telatar	Polar Codes for Arbitrary DMCs and Arbitrary MACs.	IEEE Trans. Inf. Theory	2016	DBLP DOI BibTeX RDF
16	Babak Fotouhi	Beyond the Steady-State: Analytical Study of Network Growth at Arbitrary Times, for Arbitrary Initial Conditions.	CoRR	2014	DBLP BibTeX RDF
16	Anamitra Makur, Asha Vijayakumar	Theory, Design and Application of Arbitrary Order Arbitrary Delay Filterbanks.	IEEE Trans. Signal Process.	2014	DBLP DOI BibTeX RDF
16	Rajai Nasser, Emre Telatar	Polar Codes for Arbitrary DMCs and Arbitrary MACs.	CoRR	2013	DBLP BibTeX RDF
16	Raphaël Loubère	Contribution to Lagrangian and Arbitrary-Lagrangian-Eulerian numerical schemes. (Contribution au domaine des méthodes numériques Lagrangiennes et Arbitrary-Lagrangian-Eulerian).		2013	RDF
16	Guanrong Chen	Constructing a Simple Chaotic System with an Arbitrary Number of Equilibrium Points or an Arbitrary Number of Scrolls.	NOSTRADAMUS	2013	DBLP DOI BibTeX RDF
16	Asha Vijayakumar, Anamitra Makur	Design of arbitrary delay filterbank having arbitrary order for audio applications.	WASPAA	2013	DBLP DOI BibTeX RDF
16	Yao Zhou, Jiebo Luo	A practical method for counting arbitrary target objects in arbitrary scenes.	ICME	2013	DBLP DOI BibTeX RDF
16	Louwe Bouke Kuijer	How Arbitrary Are Arbitrary Public Announcements?	ESSLLI Student Sessions	2013	DBLP DOI BibTeX RDF
16	B. Aditya Prakash, Deepayan Chakrabarti, Nicholas Valler, Michalis Faloutsos, Christos Faloutsos	Threshold conditions for arbitrary cascade models on arbitrary networks.	Knowl. Inf. Syst.	2012	DBLP DOI BibTeX RDF
16	I. Shkarofsky, Magdi Shoucri	A numerical code for the calculation of relativistic electron cyclotron damping with an arbitrary distribution function at an arbitrary harmonic.	Comput. Phys. Commun.	2011	DBLP DOI BibTeX RDF
16	Dustin Lange, Felix Naumann	Efficient similarity search: arbitrary similarity measures, arbitrary composition.	CIKM	2011	DBLP DOI BibTeX RDF
16	B. Aditya Prakash, Deepayan Chakrabarti, Michalis Faloutsos, Nicholas Valler, Christos Faloutsos	Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks.	ICDM	2011	DBLP DOI BibTeX RDF
16	Todd K. Moon, Jacob H. Gunther	Decoding by iterative detection (DECIDET): Soft-in/soft-out decoding of arbitrary linear block codes over arbitrary finite fields.	ACSCC	2011	DBLP DOI BibTeX RDF
16	Mahyar R. Malekpour	A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs: A Self-Stabilizing Distributed Clock Synchronization Protocol For Arbitrary Digraphs.	PRDC	2011	DBLP DOI BibTeX RDF
16	De-Shuang Huang, Horace Ho-Shing Ip, Ken C. K. Law, Zheru Chi, Hau-San Wong	A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials.	Appl. Math. Comput.	2005	DBLP DOI BibTeX RDF
16	Mary Mehrnoosh Eshaghian	Mapping Arbitrary Heterogeneous Task Graphs Onto Arbitrary Heterogeneous System Graphs.	Int. J. Found. Comput. Sci.	2001	DBLP DOI BibTeX RDF
16	Song Chen, Mary Mehrnoosh Eshaghian, Ying-Chieh Wu	Mapping Arbitrary Non-Uniform Task Graphs onto Arbitrary Non-Uniform System Graphs.	ICPP (2)	1995	DBLP BibTeX RDF
14	Christian Cachin, Abhi Shelat, Alexander Shraer	Efficient fork-linearizable access to untrusted shared memory.	PODC	2007	DBLP DOI BibTeX RDF	arbitrary failures, fork-consistency, storage emulations
14	Rachid Guerraoui, Marko Vukolic	Refined quorum systems.	PODC	2007	DBLP DOI BibTeX RDF	arbitrary failures, complexity, consensus, quorums, shared-memory emulations
14	Evelyne Vanraes, Adhemar Bultheel	A tangent subdivision scheme.	ACM Trans. Graph.	2006	DBLP DOI BibTeX RDF	Powell-Sabin split, Subdivision, arbitrary topology
14	Ingunn Myrtveit, Erik Stensrud, Martin J. Shepperd	Reliability and Validity in Comparative Studies of Software Prediction Models.	IEEE Trans. Software Eng.	2005	DBLP DOI BibTeX RDF	arbitrary function approximators, accuracy indicators, simulation, machine learning, reliability, validity, Software metrics, cost estimation, cross-validation, regression analysis, empirical methods, estimation by analogy
14	Cindy Grimm	Spherical manifolds for adaptive resolution surface modeling.	GRAPHITE	2005	DBLP DOI BibTeX RDF	hypberbolic geometry, parameterization, splines, hierarchical, surface modeling, arbitrary topology
14	Khanh Vu, Kien A. Hua, Wallapak Tavanapong	Image Retrieval Based on Regions of Interest.	IEEE Trans. Knowl. Data Eng.	2003	DBLP DOI BibTeX RDF	arbitrary-shaped queries, Image processing, regions of interest, image indexing and retrieval
14	Keith O. Geddes, Wei Wei Zheng	Exploiting fast hardware floating point in high precision computation.	ISSAC	2003	DBLP DOI BibTeX RDF	arbitrary precision, floating point, least squares, nonlinear systems, linear systems, iterative refinement, multiple precision
14	Victor Varshavsky, Vyacheslav Marakhovsky	GALA Approach in Design of Asynchronous Control for Counterflow Pipeline Processor.	DELTA	2002	DBLP DOI BibTeX RDF	GALA - Globally Asynchronous Locally Arbitrary, Counterflow Pipeline Processor, Synchronous Prototype, Arbitration, Asynchronous Design
14	Richard Cleve, John Watrous	Fast parallel circuits for the quantum Fourier transform.	FOCS	2000	DBLP DOI BibTeX RDF	fast parallel circuits, quantum Fourier transform, QFT, circuit depth, constant error, depth bound, polynomial size, classical polynomial-time processing, depth complexity, arbitrary modulus, lower bound, theorem proving, quantum computing, Fourier transforms, upper bound, circuit complexity, circuit complexity, quantum circuits, factoring algorithm
14	Georges-Pierre Bonneau, Stefanie Hahmann	Polyhedral modeling.	IEEE Visualization	2000	DBLP DOI BibTeX RDF	visual continuity, visualization, triangular meshes, arbitrary topology
14	Hartmut Prautzsch, Ulrich Reif	Degree estimates for Ck-piecewise polynomial subdivision surfaces.	Adv. Comput. Math.	1999	DBLP DOI BibTeX RDF	piecewise polynomial surface, extraordinary point, subdivision, arbitrary topology
14	Xuefu Wang, Fuhua Cheng, Brian A. Barsky	Blending, smoothing and interpolation of irregular meshes using N-sided Varady patches.	Symposium on Solid Modeling and Applications	1999	DBLP DOI BibTeX RDF	N-sided surfaces, Varady patches, energy optimization, computer-aided geometric design, arbitrary topology, irregular meshes
14	Ahmad H. Nasri	A four-sided approach for interpolating B-spline curves by subdivision surfaces.	Vis. Comput.	1998	DBLP DOI BibTeX RDF	B-spline, Arbitrary topology, Recursive subdivision, Curve interpolation
14	Jörg Peters 0001, Ulrich Reif	The Simplest Subdivision Scheme for Smoothing Polyhedra.	ACM Trans. Graph.	1997	DBLP DOI BibTeX RDF	characteristic map, simplest smooth subdivision, surface, arbitrary topology, box-spline
14	Herbert Edelsbrunner	Algebraic Decompositions of Non-Convex Polyhedra.	FOCS	1995	DBLP DOI BibTeX RDF	algebraic decomposition, nonconvex polyhedra, arbitrary polyhedron, algebraic sum, half-spaces, point classification, Gram-Sommerville angle relation, parallel algorithms, parallel algorithm, computational geometry, boolean formula
14	Michael Luby, Dana Randall, Alistair Sinclair	Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract).	FOCS	1995	DBLP DOI BibTeX RDF	Markov chain algorithms, planar lattice structures, domino tilings, chessboard, arbitrary tiling, parallel dominoes, two-dimensional lattices, Markov processes, combinatorics, uniform distribution, algorithm theory, statistical physics
14	Nitin H. Vaidya, Dhiraj K. Pradhan	Safe System Level Diagnosis.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	safe system level diagnosis, arbitrary t-diagnosable graphs, fault tolerant computing, diagnosis algorithm, faulty nodes, adaptive diagnosis
14	Jean Vuillemin	On Circuits and Numbers.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	PROM, 2-adic integers, synchronous decision diagrams, BDD constructs, bit-serial circuits, reset signals, 2Z, arithmetic synthesis f, periodic binary constants, deeply binding synchronous enable, combinational circuit semantics, arbitrary precision, programmable active memories, specification languages, sequential circuits, combinational circuits, digital arithmetic, logic CAD, adders, digital circuits, arithmetic, combinatorial circuits, synchronous circuits, continuous functions, rational numbers
14	Vikram S. Adve, Mary K. Vernon	Performance Analysis of Mesh Interconnection Networks with Deterministic Routing.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	mesh interconnection networks, single-hit buffers, infinite buffers, nonadaptive deadlock-free routing scheme, closedqueueing network, message blocking, message pipelining, arbitrary source-destinationprobability distribution, 2D networks, shared-memory traffic, two dimensional network, performance evaluation, performance analysis, concurrency control, probability, multiprocessor interconnection networks, queueing theory, wormhole routing, network routing, virtual channels, deterministic routing, k-ary n-cube networks, deadlock-free routing algorithm, performance issues
14	Tao Yang 0009, Apostolos Gerasoulis	DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling
14	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
14	Charles T. Loop	Smooth spline surfaces over irregular meshes.	SIGGRAPH	1994	DBLP DOI BibTeX RDF	computer-aided geometric design, arbitrary topology, geometric continuity, triangular patches, irregular meshes, B-spline surfaces
14	Woei Lin	Manipulating General Vectors on Synchronous Binary N-Cube.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	general vectors manipulation, synchronous binary n-cube, arbitrary length, collision-free vector manipulations, formal network model, collision-free routine, manipulating functions, optimal time-single network cycle, image processing, compression, multiprocessor interconnection networks, encoding, decoding, merge, data parallelism, rotation, data communication, reverse, expansion, split, vector processor systems
14	Ramesh K. Sitaraman, Niraj K. Jha	Optimal Design of Checks for Error Detection and Location in Fault-Tolerant Multiprocessor Systems.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	error location, optimal design of checks, fault-tolerant multiprocessor systems, RANDGEN, arbitrary data-check, majority diagnosability, UNIFGEN, uniform checks, fault tolerant computing, multiprocessing systems, error detection, error detection, algorithm-based fault tolerance
14	Christos Kaklamanis, Danny Krizanc, Satish Rao	Universal Emulations with Sublogarithmic Slowdown	FOCS	1993	DBLP DOI BibTeX RDF	arbitrary bounded degree networks, universal emulations, sublogarithmic slowdown, bounded degree networks, area-universal network, VLSI layout area, N-node network, sublogarithmic bounds, hypercube, butterfly
14	Scott A. Mitchell	Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles	FOCS	1993	DBLP DOI BibTeX RDF	worst case optimal, planar straight line graph, arbitrary constrained triangulation, obtuse angle, local angle condition, triangulation, Steiner points
14	Dan Halperin, Micha Sharir	Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment	FOCS	1993	DBLP DOI BibTeX RDF	single connected component, near-quadratic bounds, motion planning problem, polygonal environment, arbitrary k-sided polygonal robot, polygon, combinatorial complexity
14	Wayne Eberly	On Efficient Band Matrix Arithmetic	FOCS	1992	DBLP DOI BibTeX RDF	arbitrary fields, band matrix arithmetic, parallel Las Vegas algorithm, coefficient matrix, logarithmic time, asymptotically efficient matrix multiplication, nonsingular band matrices, parallel algorithms, determinant, linear equations, Gaussian elimination
14	Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks	A Decomposition Theorem and Bounds for Randomized Server Problems	FOCS	1992	DBLP DOI BibTeX RDF	randomized server problems, k-server problem, arbitrary metric spaces, lower bound, motion-planning, bounds, competitive ratio, decomposition theorem
14	Ioannis Z. Emiris, John F. Canny	A General Approach to Removing Degeneracies	FOCS	1991	DBLP DOI BibTeX RDF	direct perturbations, algebraic branching programs, infinite ordered field, deterministic method, determinant tests, arbitrary test expressions, complexity factors, exponential time algorithms, polynomial time algorithms, complexity class, degeneracies, nondegeneracy
14	Herbert Edelsbrunner, Tiow Seng Tan	A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	arbitrary normed metrics, quadratic time algorithm, minmax length triangulation, maximum edge length, relative neighborhood graph, triangulation
14	Weiguo Wang	An Asynchronous Two-Dimensional Self-Correcting Cellular Automaton	FOCS	1991	DBLP DOI BibTeX RDF	fault-free global synchronization clock, asynchronous two-dimensional self-correcting cellular automaton, arbitrary size, homogeneous asynchronous array, asynchronous environment, reliability, probability, reliable computation
14	Yigal Brandman, Alon Orlitsky, John L. Hennessy	A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	spectral lower bound technique, two-level AND/OR circuits, arbitrary Boolean function, power spectrum coefficients, n dimensional Fourier transform, decision trees, Boolean functions, trees (mathematics), Fourier transforms, logic circuits
14	Baruch Awerbuch, Israel Cidon, Shay Kutten	Communication-Optimal Maintenance of Replicated Information	FOCS	1990	DBLP DOI BibTeX RDF	replicated information, dynamic network protocols, arbitrary graph problem, communication-optimal maintenance, databases, communication complexity, spanning tree, dynamic network, message complexity, replicas, amortized complexity
14	Baruch Awerbuch, David Peleg	Sparse Partitions (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	sparse partitions, polynomial routing, online tracking, locality-preserving representations, graph-theoretic structures, tree covers, diameter-based separators, protocols, clustering algorithms, covers, regional matchings, network applications, decomposition techniques, arbitrary networks, sparse spanners
14	Baruch Awerbuch, Michael E. Saks	A Dining Philosophers Algorithm with Polynomial Response Time	FOCS	1990	DBLP DOI BibTeX RDF	dynamic job creation, job arrival density, conflicting jobs, asynchronous model, concurrent jobs, maximum execution time, dining philosophers algorithm, polynomial response time, distributed online algorithm, message transmission time, resource allocation, upper bound, job scheduling, resource constraints, resource requirements, arbitrary networks, distribution queue
14	Arie Segev, Jooseok Park	Updating Distributed Materialized Views.	IEEE Trans. Knowl. Data Eng.	1989	DBLP DOI BibTeX RDF	distributed materialized views, remote views, arbitrary refresh times, multiquery optimization, prescreening procedure, differential tuples, architecture, relational databases, distributed databases, efficiency, updating, distributed database systems, eliminate, differential file
14	Hyuck Yoo, Stéphane Lafortune	An Intelligent Search Method for Query Optimization by Semijoins.	IEEE Trans. Knowl. Data Eng.	1989	DBLP DOI BibTeX RDF	intelligent navigation, intelligent search method, optimal semijoin sequence, cost mode, arbitrary target lists, information retrieval, distributed databases, query optimization, knowledge engineering, space, search space, optimal solution, tree query
14	Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin	Network Decomposition and Locality in Distributed Computation	FOCS	1989	DBLP DOI BibTeX RDF	arbitrary graph, distributed algorithm, distributed computation, graph partitioning, deterministic algorithms, network decomposition
14	Jin-yi Cai	Lower Bounds for Constant Depth Circuits in the Presence of Help Bits	FOCS	1989	DBLP DOI BibTeX RDF	help bit, arbitrary Boolean function, exponential lower bound, parity functions, random oracle separation, constant depth circuits, constant depth circuit, PSPACE, PH
14	Akira Fukuda	Equilibrium Point Analysis of Memory Interference in Multiprocessor Systems.	IEEE Trans. Computers	1988	DBLP DOI BibTeX RDF	crossbar connection, equilibrium point analysis, fluid approximation, packet broadcast systems, arbitrary static memory reference patterns, bus connections, performance evaluation, performance evaluation, queueing theory, queueing theory, multiprocessing systems, multiprocessor systems, storage management, memory interference
14	Joseph C. Culberson, Robert A. Reckhow	Covering Polygons Is Hard (Preliminary Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	minimum cover problems, arbitrary polygon, orthogonal polygon, NP-hard, boundary, covering problems, convex polygons, rectangles
14	Noam Nisan, Avi Wigderson	Hardness vs. Randomness (Extended Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	pseudorandom bit generator, complexity class C, arbitrary function, lower bounds, randomness, hardness
14	William Harvey 0001, Yusu Wang 0001, Rephael Wenger	A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes.	SCG	2010	DBLP DOI BibTeX RDF	topology, randomized algorithms, reeb graph
14	Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc	How to meet when you forget: log-space rendezvous in arbitrary graphs.	PODC	2010	DBLP DOI BibTeX RDF	exploration, rendezvous, compact data structure
14	Rafael P. Torchelsen, Luiz F. Scheidegger, Guilherme N. Oliveira, Rui Bastos, João Luiz Dihl Comba	Real-time multi-agent path planning on arbitrary surfaces.	SI3D	2010	DBLP DOI BibTeX RDF	games, path planning, CUDA, geodesic distances
14	George C. Alexandropoulos, Nikos C. Sagias, Fotis I. Lazarakis, Kostas Berberidis	New results for the multivariate Nakagami-m fading model with arbitrary correlation matrix and applications.	IEEE Trans. Wirel. Commun.	2009	DBLP DOI BibTeX RDF
14	Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve Oudot	Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Restricted Delaunay triangulation, Reconstruction, Manifold, Witness complex, Weighted Delaunay triangulation
14	Jason R. Stack, Gerald J. Dobeck, Xuejun Liao, Lawrence Carin	Kernel-Matching Pursuits With Arbitrary Loss Functions.	IEEE Trans. Neural Networks	2009	DBLP DOI BibTeX RDF
14	Akihiro Kawamura, Kenji Tahara, Ryo Kurazume, Tsutomu Hasegawa	Dynamic grasping for an arbitrary polyhedral object by a multi-fingered hand-arm system.	IROS	2009	DBLP DOI BibTeX RDF
14	Morio Yoshida, Suguru Arimoto, Kenji Tahara	Pinching 2D object with arbitrary shape by two robot fingers under rolling constraints.	IROS	2009	DBLP DOI BibTeX RDF
14	Minsik Lee 0001, Chong-Ho Choi	Facial Shape Recovery from a Single Image with an Arbitrary Directional Light Using Linearly Independent Representation.	ISVC (1)	2009	DBLP DOI BibTeX RDF
14	Deepak Padmanabhan 0001, Prasad M. Deshpande, Debapriyo Majumdar, Raghu Krishnapuram	Efficient skyline retrieval with arbitrary similarity measures.	EDBT	2009	DBLP DOI BibTeX RDF
14	Juan Reig	Performance of maximal ratio combiners over correlated Nakagami-m fading channels with arbitrary fading parameters.	IEEE Trans. Wirel. Commun.	2008	DBLP DOI BibTeX RDF
14	Hongwei Li, Kui-Yip Lo, Man-Kang Leung, Chi-Wing Fu	Dual Poisson-Disk Tiling: An Efficient Method for Distributing Features on Arbitrary Surfaces.	IEEE Trans. Vis. Comput. Graph.	2008	DBLP DOI BibTeX RDF
14	Juncong Lin, Xiaogang Jin 0001, Charlie C. L. Wang, Kin-Chuen Hui	Mesh Composition on Models with Arbitrary Boundary Topology.	IEEE Trans. Vis. Comput. Graph.	2008	DBLP DOI BibTeX RDF
14	Angel Lozano, Antonia M. Tulino, Sergio Verdú	Optimum Power Allocation for Multiuser OFDM with Arbitrary Signal Constellations.	IEEE Trans. Commun.	2008	DBLP DOI BibTeX RDF
14	Volkan Isler, Malik Magdon-Ismail	Sensor Selection in Arbitrary Dimensions.	IEEE Trans Autom. Sci. Eng.	2008	DBLP DOI BibTeX RDF
14	Can Evren Yarman, Birsen Yazici, Margaret Cheney	Bistatic Synthetic Aperture Radar Imaging for Arbitrary Flight Trajectories.	IEEE Trans. Image Process.	2008	DBLP DOI BibTeX RDF
14	Marco Chiani, Alberto Zanella	Joint distribution of an arbitrary subset of the ordered eigenvalues of Wishart matrices.	PIMRC	2008	DBLP DOI BibTeX RDF
14	Xiang Lian, Lei Chen 0002	Similarity Search in Arbitrary Subspaces Under Lp-Norm.	ICDE	2008	DBLP DOI BibTeX RDF
14	Mathias Möhl, Sebastian Will, Rolf Backofen	Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots.	CPM	2008	DBLP DOI BibTeX RDF	RNA alignment, fixed parameter tractability, pseudoknots
14	Hongzhi Zhao, Yi Gong 0001, Yong Liang Guan 0001, Shaoqian Li	Performance Analysis of Space-Time Block Codes in Nakagami-m Keyhole Channels with Arbitrary Fading Parameters.	ICC	2008	DBLP DOI BibTeX RDF
14	Il Hong Shin, Jeongju Yu, Jinwoo Hong	A fast down-sampling method for arbitrary-ratio spatial scalability based on type-II DCT.	ICASSP	2008	DBLP DOI BibTeX RDF
14	Xu Ling, Qiaozhu Mei, ChengXiang Zhai, Bruce R. Schatz	Mining multi-faceted overviews of arbitrary topics in a text collection.	KDD	2008	DBLP DOI BibTeX RDF	multi-faceted overview, text mining, statistical topic models
14	Srikanth Jagabathula, Devavrat Shah	Optimal delay scheduling in networks with arbitrary constraints.	SIGMETRICS	2008	DBLP DOI BibTeX RDF	delay, throughput, scheduling algorithm
14	Jens B. Schmitt, Frank A. Zdarsky, Markus Fidler	Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...	INFOCOM	2008	DBLP DOI BibTeX RDF
14	Pingda Shu, Huahui Chen 0001	A New Method to Find Top K Items in Data Streams at Arbitrary Time Granularities.	CSSE (4)	2008	DBLP DOI BibTeX RDF
14	Weibo Hu, Chung Len Lee 0001, Xin'an Wang	Arbitrary Waveform Generator Based on Direct Digital Frequency Synthesizer.	DELTA	2008	DBLP DOI BibTeX RDF