5356 search results - page 256 / 1072 » Adventures in time and space |
132
click to vote
ACL
2012
13 years 9 months ago
2012
This paper presents a joint model for template filling, where the goal is to automatically specify the fields of target relations such as seminar announcements or corporate acqu...
154
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
187
click to vote
DCG
2008
15 years 6 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
198
click to vote
IPM
2006
15 years 6 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
150
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...