432 search results - page 61 / 87 » Open Problems with Part-Whole Relations |
162
Voted
CANDC
2011
ACM
14 years 16 days ago
2011
ACM
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
106
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
128
click to vote
ESORICS
2009
Springer
15 years 7 months ago
2009
Springer
The increasing availability of space-time trajectories left by location-aware devices is expected to enable novel classes of applications where the discovery of consumable, concise...
PODS
2006
ACM
16 years 21 days ago
2006
ACM
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
134
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...