Sciweavers

30 search results - page 4 / 6
» Computing Canonical Polygonal Schemata with Generalized Maps
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
Scalable routing in 3D high genus sensor networks using graph embedding
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
Xiaokang Yu, Xiaotian Yin, Wei Han, Jie Gao, Xianf...
COMGEO
2006
ACM
13 years 7 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
ACL
2011
12 years 11 months ago
From Bilingual Dictionaries to Interlingual Document Representations
Mapping documents into an interlingual representation can help bridge the language barrier of a cross-lingual corpus. Previous approaches use aligned documents as training data to...
Jagadeesh Jagarlamudi, Hal Daumé III, Ragha...
DAC
2005
ACM
14 years 8 months ago
Correlation-preserved non-gaussian statistical timing analysis with quadratic timing model
Recent study shows that the existing first order canonical timing model is not sufficient to represent the dependency of the gate delay on the variation sources when processing an...
Lizheng Zhang, Weijen Chen, Yuhen Hu, John A. Gubn...
IWCIA
2009
Springer
14 years 2 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...