Sciweavers

20638 search results - page 4055 / 4128
» Computer Networks
Sort
View
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
15 years 10 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
TCSV
2002
134views more  TCSV 2002»
14 years 9 months ago
Factor graph framework for semantic video indexing
Video query by semantic keywords is one of the most challenging research issues in video data management. To go beyond low-level similarity and access video data content by semanti...
Milind R. Naphade, Igor Kozintsev, Thomas S. Huang
ICC
2009
IEEE
144views Communications» more  ICC 2009»
15 years 4 months ago
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
Virag Shah, Neelesh B. Mehta, Raymond Yim
HT
1993
ACM
15 years 1 months ago
Concurrency Control in Collaborative Hypertext Systems
Traditional concurrency control techniques for database systems (transaction management based on locking protocols) have been successful in many multiuser settings, but these tech...
Uffe Kock Wiil, John J. Leggett
PVLDB
2008
107views more  PVLDB 2008»
14 years 9 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
« Prev « First page 4055 / 4128 Last » Next »