3082 search results - page 462 / 617 » its 2004 |
171
click to vote
FGR
2004
IEEE
15 years 10 months ago
2004
IEEE
We develop a new model-based extraction process guided by biomechanical analysis for walking people, and analyse its data for recognition capability. Hierarchies of shape and moti...
198
Voted
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
181
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
201
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
208
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...