427 search results - page 76 / 86 » Computing the Local Consensus of Trees |
103
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
115
click to vote
EMNLP
2008
14 years 11 months ago
2008
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...
180
Voted
ICDE
2004
IEEE
15 years 10 months ago
2004
IEEE
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We investigate the problem of learning to predict moves in the board game of Go from game records of expert players. In particular, we obtain a probability distribution over legal...
PODS
2003
ACM
15 years 9 months ago
2003
ACM
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...