Search results for "dimension D"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Jean-Daniel Boissonnat, Arijit Ghosh	Manifold reconstruction using tangential Delaunay complexes.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	manifold reconstruction, sampling conditions, sliver exudation, tangential complex, manifold learning, weighted delaunay triangulation
1	Karl Bringmann	Klee's measure problem on fat boxes in time PARTIAL DIFFERENTIAL (n(d+2)/3).	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	union of cubes, geometric data structures
1	David M. Mount, Eunhui Park	A dynamic data structure for approximate range searching.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	approximation algorithms, quadtrees, range searching, dynamic data structures, geometric data structures
1	Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking	Online capacity maximization in wireless networks.	SPAA	2010	DBLP DOI BibTeX RDF	online algorithms, competitive analysis, physical model, sinr
1	Karl Mosler, Tatjana Lange, Pavel Bazovkin	Computing zonoid trimmed regions of dimension d>2.	Computational Statistics & Data Analysis	2009	DBLP DOI BibTeX RDF
1	Joe Shanahan	Students create game-based online learning environment that teaches Java programing.	ACM Southeast Regional Conference	2009	DBLP DOI BibTeX RDF	Java-education, dimension D, educational MMORPG, educational multi-media, educational video games, online world, Java, e-learning, virtual world, online community, edutainment, game-based learning, MMORPG
1	Guo-Jun Qi, Jinhui Tang, Zheng-Jun Zha, Tat-Seng Chua, Hong-Jiang Zhang	An efficient sparse metric learning in high-dimensional space via l1-penalized log-determinant regularization.	ICML	2009	DBLP DOI BibTeX RDF
1	Eli Ben-Sasson, Swastik Kopparty	Affine dispersers from subspace polynomials.	STOC	2009	DBLP DOI BibTeX RDF	randomness, extractors
1	Mikhail J. Atallah, Marina Blanton, Nelly Fazio, Keith B. Frikken	Dynamic and Efficient Key Management for Access Hierarchies.	ACM Trans. Inf. Syst. Secur.	2009	DBLP DOI BibTeX RDF	Efficient key derivation, key management, hierarchical access control
1	Farshid Delgosha, Faramarz Fekri	A multivariate key-establishment scheme for wireless sensor networks.	IEEE Transactions on Wireless Communications	2009	DBLP DOI BibTeX RDF
1	Wei Lu, Zheng-an Yao	Nearest Neighbor Tour Circuit Encryption Algorithm Based Random Isomap Reduction.	ADMA	2009	DBLP DOI BibTeX RDF	Random Isomap reduction, encryption, nearest neighbor, geodesic distance, sensitive information
1	Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf	Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs.	ESA	2009	DBLP DOI BibTeX RDF
1	Panos Giannopoulos, Christian Knauer, Günter Rote	The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.	IWPEC	2009	DBLP DOI BibTeX RDF	geometric dimension, minimum enclosing cylinder, maximum feasible subsystem, 2-linear separability, lower bounds, parameterized complexity
1	Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve Oudot	Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Restricted Delaunay triangulation, Reconstruction, Manifold, Witness complex, Weighted Delaunay triangulation
1	Antoine Deza, Tamás Terlaky, Yuriy Zinchenko	A Continuous d -Step Conjecture for Polytopes.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Hirsch conjecture, d-Step conjecture, Diameter, Curvature, Polytopes, Central path
1	Yingguang Li, M. Tamer Özsu, Kian-Lee Tan	XCube: Processing XPath queries in a hypercube overlay network.	Peer-to-Peer Networking and Applications	2009	DBLP DOI BibTeX RDF	XML, Query processing, Distributed databases, Data communications
1	Timothy M. Chan	A (slightly) faster algorithm for klee's measure problem.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	union of geometric objects, data structures, boxes
1	Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote	Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.	SODA	2008	DBLP DOI BibTeX RDF	clustering, complexity, lower bound, dimension, fixed-parameter tractability
1	Dragos Calitoiu, Doron Nussbaum, B. John Oommen	Large scale modeling of the piriform cortex for analyzing antiepileptic effects.	SpringSim	2008	DBLP DOI BibTeX RDF	nonlinear interdependence, piriform cortex, chaos, Lyapunov exponents
1	Edward Oczeretko, Marta Borowska, Agnieszka Kitlas, Andrzej Borusiewicz, Malgorzata Sobolewska-Siemieniuk	Fractal analysis of medical images in the irregular regions of interest.	BIBE	2008	DBLP DOI BibTeX RDF
1	Zeev Dvir, Amir Shpilka	Towards Dimension Expanders over Finite Fields.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	Cayley graphs, expanders, explicit constructions
1	Tong Lin, Hongbin Zha	Riemannian Manifold Learning.	IEEE Trans. Pattern Anal. Mach. Intell.	2008	DBLP DOI BibTeX RDF	manifold reconstruction, Riemannian normal coordinates, Dimensionality reduction, manifold learning, Riemannian manifolds
1	Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu	Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance.	COCOON	2008	DBLP DOI BibTeX RDF
1	Alain Daurat, Mohamed Tajine, Mahdi Zouaoui	About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators.	DGCI	2008	DBLP DOI BibTeX RDF	(m,n)-cube, Local Estimator, Multigrid Convergence, Pattern, Area Estimator, Digital Plane
1	Sergio Decherchi, Paolo Gastaldo, Judith Redi, Rodolfo Zunino	Non-stationary Data Mining: The Network Security Issue.	ICANN	2008	DBLP DOI BibTeX RDF	K-Winner Machine, Data Mining, Clustering, Network security, Intrusion detection systems
1	Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu	Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.	LATIN	2008	DBLP DOI BibTeX RDF
1	Markus Grassl	Computing Equiangular Lines in Complex Space.	MMICS	2008	DBLP DOI BibTeX RDF
1	Augustin Chaintreau	Sharpness: A Tight Condition for Scalability.	SIROCCO	2008	DBLP DOI BibTeX RDF
1	Gui-Bo Ye, Ding-Xuan Zhou	Learning and approximation by Gaussians on Riemannian manifolds.	Adv. Comput. Math.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68T05, 62J02
1	Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips	Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.	Algorithmica	2008	DBLP DOI BibTeX RDF	Manhattan distance, Clustering, Approximation, Supercomputers, Communication cost, Processor allocation, Polynomial-time approximation scheme (PTAS)
1	Alexander I. Barvinok, Isabella Novik	A Centrally Symmetric Version of the Cyclic Polytope.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF
1	Jie Gao, Michael Langberg, Leonard J. Schulman	Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Helly theorem, Clustering, Approximation, Inference, Incomplete data, k-center, Core set
1	Gil Kalai, Avi Wigderson	Neighborly Embedded Manifolds.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Neighborliness, Cyclic polytopes, Continuous hashing, Polytopes, Convex bodies
1	Hanno Lefmann	Distributions of Points in d Dimensions and Large k -Point Simplices.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Heilbronn’s triangle problem, Hypergraphs, Independence number
1	Ezra Miller, Igor Pak	Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF
1	Richard Vale, Shayne Waldron	Tight frames generated by finite nonabelian groups.	Numerical Algorithms	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) Primary 20C15, 41A65, Secondary 65T60, 94A11, 94A12, 94A15, 41A63, 42C15
1	Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr	Traversing a set of points with a minimum number of turns.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	minimum link spanning path, approximation algorithms, computational geometry
1	Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve Oudot	Manifold reconstruction in arbitrary dimensions using witness complexes.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	manifold reconstruction, restricted Delaunay triangulation, sampling conditions, witness complex
1	Dan Feldman, Morteza Monemizadeh, Christian Sohler	A PTAS for k-means clustering based on weak coresets.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	approximation, k-mean, geometric optimization, coresets
1	Timothy M. Chan	More algorithms for all-pairs shortest paths in weighted graphs.	STOC	2007	DBLP DOI BibTeX RDF	computational geometry, shortest paths, graph algorithms, matrix multiplication
1	Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang	Phase changes in random point quadtrees.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Asymptotic transfer, analysis in distribution of algorithms, grid trees, local limit theorems, page usage, total path length, quadtrees, differential equations, phase transitions, depth, central limit theorems, Mellin transforms
1	Oded Regev, Ben Toner	Simulating Quantum Correlations with Finite Communication.	FOCS	2007	DBLP DOI BibTeX RDF
1	Joel A. Tropp, Anna C. Gilbert	Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
1	Ming Li, S. C. Lim, Huamin Feng	Generating Traffic Time Series Based on Generalized Cauchy Process.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	Random data generation, generalized Cauchy process, self-similarity, long-range dependence, network traffic
1	Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson	Scheduling with Precedence Constraints of Low Fractional Dimension.	IPCO	2007	DBLP DOI BibTeX RDF
1	Wei Hu, Jingtao Hu	A New BP Network Based on Improved PSO Algorithm and Its Application on Fault Diagnosis of Gas Turbine.	ISNN	2007	DBLP DOI BibTeX RDF
1	Benjamin Nill	Volume and Lattice Points of Reflexive Simplices.	Discrete & Computational Geometry	2007	DBLP DOI BibTeX RDF
1	Zhe Wang, Songcan Chen	New Least Squares Support Vector Machines Based on Matrix Patterns.	Neural Processing Letters	2007	DBLP DOI BibTeX RDF	Fuzzy least squares support vector machine (FLS-SVM), Vector pattern, Matrix pattern, Pattern recognition, Support vector machine (SVM), Least squares support vector machine (LS-SVM)
1	Pedro A. Diaz-Gomez, Dean F. Hougen	The snake in the box problem: mathematical conjecture and a genetic algorithm approach.	GECCO	2006	DBLP DOI BibTeX RDF	genetic algorithms, hypercubes
1	Mikhail J. Atallah, Marina Blanton, Keith B. Frikken	Key management for non-tree access hierarchies.	SACMAT	2006	DBLP DOI BibTeX RDF	access hierarchy, dimension of a graph, fast key derivation
1	Jie Gao, Michael Langberg, Leonard J. Schulman	Analysis of incomplete data and an intrinsic-dimension Helly theorem.	SODA	2006	DBLP DOI BibTeX RDF
1	Clifford K. F. So, George Baciu	Hypercube sweeping algorithm for subsequence motion matching in large motion databases.	VRCIA	2006	DBLP DOI BibTeX RDF	motion capture animation, multi-dimensional time-series data, non-uniform time-warping, subsequence matching
1	Uli Wagner	On a Geometric Generalization of the Upper Bound Theorem.	FOCS	2006	DBLP DOI BibTeX RDF
1	Pedro A. Diaz-Gomez, Dean F. Hougen	Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions.	SNPD	2006	DBLP DOI BibTeX RDF
1	Andrzej Lingas, Mia Persson, Martin Wahlen	Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case).	CAAN	2006	DBLP DOI BibTeX RDF
1	Sergio Cabello, Panos Giannopoulos, Christian Knauer	On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.	IWPEC	2006	DBLP DOI BibTeX RDF
1	Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh	I/O-Efficient Well-Separated Pair Decomposition and Applications.	Algorithmica	2006	DBLP DOI BibTeX RDF
1	Shmuel Safra, Oded Schwartz	On the complexity of approximating tsp with neighborhoods and related problems.	Computational Complexity	2006	DBLP DOI BibTeX RDF	68Q25, Subject classification. 68Q17
1	Wolfgang Hackbusch, Boris N. Khoromskij	Low-rank Kronecker-product Approximation to Multi-dimensional Nonlocal Operators. Part II. HKT Representation of Certain Operators.	Computing	2006	DBLP DOI BibTeX RDF	Kronecker tensor-product, high spatial dimension, Sinc-interpolation, Sinc-quadrature, Hierarchical matrices
1	Wolfgang Hackbusch, Boris N. Khoromskij	Low-rank Kronecker-product Approximation to Multi-dimensional Nonlocal Operators. Part I. Separable Approximation of Multi-variate Functions.	Computing	2006	DBLP DOI BibTeX RDF	Kronecker tensor-product, sinc interpolation, sinc quadrature, approximation by exponential sums, Hierarchical matrices
1	Achill Schürmann, Frank Vallentin	Computational Approaches to Lattice Packing and Covering Problems.	Discrete & Computational Geometry	2006	DBLP DOI BibTeX RDF
1	P. Oscar Boykin, Vwani P. Roychowdhury	Information vs. disturbance in dimension D.	Quantum Information & Computation	2005	DBLP BibTeX RDF
1	Gereon Frahling, Piotr Indyk, Christian Sohler	Sampling in dynamic data streams and applications.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	data structures, computational geometry, streaming algorithms
1	Tobias Lenz	Reconstructing collections of arbitrary curves.	Symposium on Computational Geometry	2005	DBLP DOI BibTeX RDF	intersection, greedy, curve reconstruction
1	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-time tradeoffs for approximate spherical range counting.	SODA	2005	DBLP DOI BibTeX RDF
1	Brian C. Dean, Michel X. Goemans, Jan Vondrák	Adaptivity and approximation for stochastic packing problems.	SODA	2005	DBLP DOI BibTeX RDF
1	Anna Bartkowiak, Piotr Lipinski	Remarks on Evaluation of Correlation Dimension for 5 French Stock Data.	SYNASC	2005	DBLP DOI BibTeX RDF
1	Madhav P. Desai, D. Manjunath	On Range Matrices and Wireless Networks in d Dimensions.	WiOpt	2005	DBLP DOI BibTeX RDF	Range Matrices, Ad Hoc Networks, Geometric Random Graphs
1	Shirley Halevy, Eyal Kushilevitz	A Lower Bound for Distribution-Free Monotonicity Testing.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
1	Hanno Lefmann	Distributions of Points in d Dimensions and Large k-Point Simplices.	COCOON	2005	DBLP DOI BibTeX RDF
1	Dima Kuzmin, Manfred K. Warmuth	Unlabeled Compression Schemes for Maximum Classes, .	COLT	2005	DBLP DOI BibTeX RDF
1	Nir Ailon, Bernard Chazelle	Information Theory in Property Testing and Monotonicity Testing in Higher Dimension.	STACS	2005	DBLP DOI BibTeX RDF
1	Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips	Communication-Aware Processor Allocation for Supercomputers.	WADS	2005	DBLP DOI BibTeX RDF
1	Ivan P. Gavrilyuk, Wolfgang Hackbusch, Boris N. Khoromskij	Hierarchical Tensor-Product Approximation to the Inverse and Related Operators for High-Dimensional Elliptic Problems.	Computing	2005	DBLP DOI BibTeX RDF	Kronecker tensor products, high space dimensions, Sinc-quadrature, Hierarchical matrices
1	Boris Aronov, Vladlen Koltun, Micha Sharir	Incidences between Points and Circles in Three and Higher Dimensions.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Valeriu Soltan	Pairs of Convex Bodies with Centrally Symmetric Intersections of Translates.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Kasturi R. Varadarajan	A near-linear constant-factor approximation for euclidean bipartite matching?	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	approximation algorithms, combinatorial optimization, matching
1	Thomas Bayer	Optimal descriptions of orbit spaces and strata of finite groups.	ISSAC	2004	DBLP DOI BibTeX RDF	symbolic computation, stratification
1	Timothy M. Chan	An optimal randomized algorithm for maximum Tukey depth.	SODA	2004	DBLP DOI BibTeX RDF
1	Leah Epstein, Rob van Stee	Optimal online bounded space multidimensional packing.	SODA	2004	DBLP DOI BibTeX RDF
1	Scott Aaronson	Lower bounds for local search by quantum arguments.	STOC	2004	DBLP DOI BibTeX RDF	query complexity (black box, decision tree), local search, quantum computing, PLS, local optima
1	Debasish Chakraborty, Ahmed Ashir, Takuo Suganuma, Glenn Mansfield Keeni, T. K. Roy, Norio Shiratori	Self-similar and fractal nature of internet traffic.	Int. Journal of Network Management	2004	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan	Approximating extent measures of points.	J. ACM	2004	DBLP DOI BibTeX RDF	Computational geometry, approximation
1	Chung-Min Chen, Christine T. Cheng	From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries.	J. ACM	2004	DBLP DOI BibTeX RDF	Declustering schemes, disk allocations, range query, parallel database
1	Rahul Savani, Bernhard von Stengel	Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game.	FOCS	2004	DBLP DOI BibTeX RDF
1	Rommel G. Regis, Christine A. Shoemaker	Local function approximation in evolutionary algorithms for the optimization of costly functions.	IEEE Trans. Evolutionary Computation	2004	DBLP DOI BibTeX RDF
1	Hanno Lefmann	Large Triangles in the d-Dimensional Unit-Cube.	COCOON	2004	DBLP DOI BibTeX RDF
1	Peter Auer, Ronald Ortner	A New PAC Bound for Intersection-Closed Concept Classes.	COLT	2004	DBLP DOI BibTeX RDF
1	Manfred K. Warmuth	The Optimal PAC Algorithm.	COLT	2004	DBLP DOI BibTeX RDF
1	Joseph JáJá, Christian Worm Mortensen, Qingmin Shi	Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting.	ISAAC	2004	DBLP DOI BibTeX RDF
1	Christian Schindelhauer, Klaus Volbert, Martin Ziegler	Spanners, Weak Spanners, and Power Spanners for Wireless Networks.	ISAAC	2004	DBLP DOI BibTeX RDF
1	René Brandenberg, Abhi Dattasharma, Peter Gritzmann, David G. Larman	Isoradial Bodies.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Joachim Giesen, Uli Wagner	Shape Dimension and Intrinsic Metric from Samples of Manifolds.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Erich Novak, Ian H. Sloan, Henryk Wozniakowski	Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers.	Foundations of Computational Mathematics	2004	DBLP DOI BibTeX RDF	Korobov spaces, Approximation, Randomized algorithms, Quantum computation, Tractability
1	Allan Borodin, Rafail Ostrovsky, Yuval Rabani	Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.	Machine Learning	2004	DBLP DOI BibTeX RDF	graph-theoretic clustering, sparse partitions, high dimensional spaces
1	Peter Z. Revesz, Yi Chen	Efficient Aggregation over Moving Objects. (PDF / PS)	TIME	2003	DBLP DOI BibTeX RDF
1	Piet W. Verbeek, Judith Dijk	The D-Dimensional Inverse Vector-Gradient Operator and Its Application for Scale-Free Image Enhancement.	CAIP	2003	DBLP DOI BibTeX RDF
1	Michiel Hagedoorn	Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size.	ICDT	2003	DBLP BibTeX RDF
1	Yingyu Ye, Jiawei Zhang	An Improved Algorithm for Approximating the Radii of Point Sets.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
1	Stefan Langerman, William L. Steiger	The Complexity of Hyperplane Depth in the Plane.	Discrete & Computational Geometry	2003	DBLP DOI BibTeX RDF