2713 search results - page 366 / 543 » Designing Personal Tele-Embodiment |
140
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
158
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
154
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
152
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
135
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...