Sciweavers

1208 search results - page 97 / 242
» On Counting Generalized Colorings
Sort
View
UIST
2006
ACM
15 years 9 months ago
Projector-guided painting
This paper presents a novel interactive system for guiding artists to paint using traditional media and tools. The enabling technology is a multi-projector display capable of cont...
Matthew Flagg, James M. Rehg
SPAA
2003
ACM
15 years 8 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
ICALP
2009
Springer
16 years 3 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ICDE
2006
IEEE
95views Database» more  ICDE 2006»
16 years 4 months ago
Learning from Aggregate Views
In this paper, we introduce a new class of data mining problems called learning from aggregate views. In contrast to the traditional problem of learning from a single table of tra...
Bee-Chung Chen, Lei Chen 0003, Raghu Ramakrishnan,...
COMPGEOM
2006
ACM
15 years 9 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl