Sciweavers

85 search results - page 12 / 17
» Factorization with genus 2 curves
Sort
View
COMPGEOM
2003
ACM
14 years 22 days ago
Curve-sensitive cuttings
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
Vladlen Koltun, Micha Sharir
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian
COMPGEOM
2010
ACM
14 years 17 days ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
IPSN
2007
Springer
14 years 1 months ago
Improving wireless simulation through noise modeling
We propose modeling environmental noise in order to efficiently and accurately simulate wireless packet delivery. We measure noise traces in many different environments and propo...
HyungJune Lee, Alberto Cerpa, Philip Levis
MICCAI
2005
Springer
14 years 8 months ago
Automated Surface Matching Using Mutual Information Applied to Riemann Surface Structures
Many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. To avoid the need for a large set of manually-d...
Yalin Wang, Ming-Chang Chiang, Paul M. Thompson