301 search results - page 34 / 61 » The k-Median Problem for Directed Trees |
NIPS
2001
13 years 9 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
EDBT
2010
ACM
14 years 11 days ago
2010
ACM
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
CHI
2007
ACM
14 years 8 months ago
2007
ACM
This paper describes the iterative development of a visualization for a wiki used in a large enterprise to manage research projects. An initial prototype-based field study exposed...
CONPAR
1992
13 years 11 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...