Sciweavers

354 search results - page 12 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
IROS
2008
IEEE
144views Robotics» more  IROS 2008»
15 years 6 months ago
Frame rate object extraction from video sequences with self organizing networks and statistical background detection
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...
Thiago C. Bellardi, Dizan Vasquez, Christian Laugi...
MM
1997
ACM
97views Multimedia» more  MM 1997»
15 years 3 months ago
A Failure and Overload Tolerance Mechanism for Continuous Media Servers
–Large scale clustered continuous media (CM) servers deployed in applications like video-on-demand have high availability requirements. In the event of server failure, streams fr...
Rajesh Krishnan, Dinesh Venkatesh, Thomas D. C. Li...
79
Voted
RT
2004
Springer
15 years 5 months ago
A Self-Shadow Algorithm for Dynamic Hair using Density Clustering
Self-shadowing is an important factor in the appearance of hair and fur. In this paper we present a new rendering algorithm to accurately compute shadowed hair at interactive rate...
Tom Mertens, Jan Kautz, Philippe Bekaert, Frank Va...
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
15 years 8 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
115
Voted
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 8 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...