5100 search results - page 924 / 1020 » The Linear Complexity of a Graph |
147
Voted
INFORMS
1998
15 years 4 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
147
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
144
click to vote
MTA
2007
15 years 4 months ago
2007
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
147
click to vote
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
171
click to vote
WCNC
2010
IEEE
15 years 2 months ago
2010
IEEE
: The two-phase MIMO NC (network coding) scheme can be used to boost the throughput in a two-way relay channel in which nodes are equipped with multiple antennas. The obvious strat...