281 search results - page 40 / 57 » On Embedding a Graph on Two Sets of Points |
TAPSOFT
1997
Springer
15 years 1 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
BVAI
2005
Springer
15 years 3 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
90
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
A practical lipreading system can be considered either as subject dependent (SD) or subject-independent (SI). An SD system is user-specific, i.e., customized for some particular ...
92
Voted
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
189
click to vote
COMBINATORICA
2011
13 years 9 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...