7006 search results - page 1350 / 1402 » Approximation Algorithms |
197
Voted
VLDB
2007
ACM
16 years 27 days ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
132
click to vote
EDBT
2010
ACM
15 years 7 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
88
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
135
Voted
SSDBM
2010
IEEE
15 years 5 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....