385 search results - page 47 / 77 » Tracking the Best Disjunction |
136
Voted
GD
2004
Springer
15 years 8 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
117
Voted
OOPSLA
1999
Springer
15 years 7 months ago
1999
Springer
Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which ...
125
click to vote
CLEF
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2006. This year we are not using the tools for thesaurus-based query expansion a...
122
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
123
click to vote
JMM2
2006
15 years 3 months ago
2006
We propose algorithms and applications for using the hand as an interface device in virtual and physical spaces. In virtual drawing, by tracking the hand in 3D and estimating a vir...