Sciweavers

129 search results - page 10 / 26
» A Graph Reduction Method for 2D Snake Problems
Sort
View
CAD
2002
Springer
14 years 9 months ago
Surface flattening based on energy model
This paper presents a method for three-dimensional surface flattening, which can be efficiently used in threedimensional computer aided garment design. First, facet model is used ...
Charlie C. L. Wang, Shana S.-F. Smith, Matthew Min...
IDEAS
2000
IEEE
117views Database» more  IDEAS 2000»
15 years 2 months ago
Path Query Reduction and Diffusion for Distributed Semi-Structured Data Retrieval
I n this paper, we address the problem of query processing o n distributed semi-structured data. The distributed semistructured data can be modeled as a rooted and edge-labeled gr...
Jaehyung Lee, Yon Dohn Chung, Myoung-Ho Kim
NIPS
2003
14 years 11 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
15 years 10 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
CN
2007
95views more  CN 2007»
14 years 9 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...