612 search results - page 55 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
CHI
2009
ACM
14 years 8 months ago
2009
ACM
The ways in which users appropriate uses of technology ? or invent new ones ? have attracted interest in CSCW-oriented research, but much less has been written on its cognitive fo...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...