Sciweavers

5733 search results - page 1092 / 1147
» Clustering Categorical Data
Sort
View
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
13 years 28 days ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ï¬...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
CVPR
1999
IEEE
15 years 4 days ago
Background Estimation and Removal Based on Range and Color
Background estimation and removal based on the joint use of range and color data produces superior results than can be achieved with either data source alone. This is increasingly...
Gaile G. Gordon, Trevor Darrell, Michael Harville,...
ECCV
2006
Springer
15 years 4 hour ago
A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
Jingyu Yan, Marc Pollefeys
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 12 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
14 years 11 months ago
Uncovering Database Access Optimizations in the Middle Tier with TORPEDO
A popular architecture for enterprise applications is one of a stateless object-based server accessing persistent data through Object-Relational mapping software. The reported ben...
Bruce E. Martin
« Prev « First page 1092 / 1147 Last » Next »