Sciweavers

90 search results - page 13 / 18
» Stipple Placement using Distance in a Weighted Graph
Sort
View
92
Voted
AAAI
2007
15 years 1 months ago
Isometric Projection
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
Deng Cai, Xiaofei He, Jiawei Han
97
Voted
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 1 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
15 years 6 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
133
Voted
ICIP
2009
IEEE
15 years 10 months ago
Edge-preserving Colorization using Data-Driven Random Walks with Restart
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
Tae Hoon Kim (Seoul National University), Kyoung M...
109
Voted
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 1 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani