3341 search results - page 323 / 669 » On Bounded Queries and Approximation |
149
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper we consider UWB (ultra wide band) based positioning. We derive the CRBs (Cramer Rao bound) for AOA (angle of arrival) and for hybrid method using both AOA and TOA...
152
click to vote
ICANNGA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
188
click to vote
ACSC
2005
IEEE
16 years 12 days ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
187
click to vote
WAOA
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
154
click to vote
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...