8695 search results - page 239 / 1739 » Making the Complex Simple |
283
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
181
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
175
click to vote
ICDE
2006
IEEE
16 years 20 days ago
2006
IEEE
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
185
click to vote
MM
2006
ACM
16 years 18 days ago
2006
ACM
We create interactive art that can be enjoyed by groups such as audiences at public events with the intent to encourage communication with those around us as we play with the art....
190
click to vote
PODC
2006
ACM
16 years 18 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...