2061 search results - page 139 / 413 » The continuous knapsack set |
124
click to vote
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
136
click to vote
IJCNLP
2004
Springer
15 years 9 months ago
2004
Springer
The paper discusses two policies for recognizing NEs with complex structures by maximum entropy models. One policy is to develop cascaded MaxEnt models at different levels. The ot...
140
click to vote
AMFG
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper we describe an approach for inferring the body posture using a 3D visual-hull constructed from a set of silhouettes. We introduce an appearance-based, view-independe...
127
click to vote
CSEE
2000
Springer
15 years 8 months ago
2000
Springer
Teaching provides many challenges. Presenting Software Engineering to students brings a teacher face to face with a most unwieldy subject. Packaging this subject for delivery to a...
111
click to vote
ITICSE
1999
ACM
15 years 8 months ago
1999
ACM
We present our work on building interactive continuous visualisations of distributed algorithms for educational purposes. The animations are comprised by a set of visualisation wi...