5100 search results - page 959 / 1020 » The Linear Complexity of a Graph |
143
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
135
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
Model Driven Architecture (MDA) is a software development approach that focuses on models. In order to support MDA, a lot of CASE tools have emerged; each of them provides a diffe...
119
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
159
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
168
click to vote
ESWS
2005
Springer
15 years 10 months ago
2005
Springer
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g....