Sciweavers

6455 search results - page 400 / 1291
» Research problems
Sort
View
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 8 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
ICCV
2009
IEEE
16 years 11 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
SIGMETRICS
2002
ACM
101views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
A performance study of Bistro, a scalable upload architecture
Hot spots are a major obstacle to achieving scalability in the Internet. We have observed that the existence of hot spots in upload applications (whose examples include submission...
William C. Cheng, Cheng-Fu Chou, Leana Golubchik, ...
EUSFLAT
2007
15 years 8 months ago
Recent Advances in the Field of Left-continuous t-norms
The recent advances in the research of left-continuous t-norms is summarized in this talk. The main focus is on construction methods, geometric description, and structural charact...
Sándor Jenei
SIGMOD
2012
ACM
242views Database» more  SIGMOD 2012»
13 years 9 months ago
Dynamic management of resources and workloads for RDBMS in cloud: a control-theoretic approach
As cloud computing environments become explosively popular, dealing with unpredictable changes, uncertainties, and disturbances in both systems and environments turns out to be on...
Pengcheng Xiong