3008 search results - page 546 / 602 » Independence in connected graphs |
179
click to vote
IACR
2011
14 years 6 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
183
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
166
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
171
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
191
click to vote
ERCIMDL
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. The PROBADO project is a research effort to develop Digital Library support for non-textual documents. The main goal is to contribute to all parts of the Digital Library...