Sciweavers

310 search results - page 44 / 62
» Cutting two graphs simultaneously
Sort
View
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
14 years 5 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
IJRR
2002
126views more  IJRR 2002»
13 years 10 months ago
Sensor-based Coverage of Unknown Environments
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
Ercan U. Acar, Howie Choset
FOCS
1995
IEEE
14 years 1 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
CGF
2007
157views more  CGF 2007»
13 years 10 months ago
Mesh Segmentation via Spectral Embedding and Contour Analysis
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
Rong Liu, Hao Zhang 0002
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 5 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...