301 search results - page 46 / 61 » On Finding Dense Subgraphs |
124
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper deals with estimation of dense optical flow
and ego-motion in a generalized imaging system by exploiting
probabilistic linear subspace constraints on the flow.
We dea...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Shape is an important cue for generic object recognition but can be insufficient without other cues such as object appearance. We explore a number of ways in which the geometric a...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
177
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
CPM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...