563 search results - page 59 / 113 » Computing approximate PSD factorizations |
CVPR
2005
IEEE
14 years 12 months ago
2005
IEEE
Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image fea...
ICAC
2007
IEEE
14 years 4 months ago
2007
IEEE
— The multi-tier implementation has become the industry standard for developing scalable client-server enterprise applications. Since these applications are performance sensitive...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
DCOSS
2008
Springer
13 years 11 months ago
2008
Springer
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...