19866 search results - page 3950 / 3974 » Computing all factorizations in *** |
128
click to vote
CCR
2011
14 years 4 months ago
2011
ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Processes of Place/Transition Systems6 Rob van Glabbeeka,b , Ursula Goltzc , Jens-Wolfhard Schickec aNICTA, Sydney, Australia bSchool of Computer Science and Engineering, Universit...
102
click to vote
CIVR
2010
Springer
14 years 4 months ago
2010
Springer
Current content-based video copy detection approaches mostly concentrate on the visual cues and neglect the audio information. In this paper, we attempt to tackle the video copy d...