308 search results - page 27 / 62 » How Fast Is the k-Means Method |
131
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
144
Voted
CHI
2005
ACM
16 years 3 months ago
2005
ACM
How do people make sense of a video based on viewing a few frames of that video? What elements constitute the "visual gist" in their minds? Answers to these questions wi...
124
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
149
Voted
AICT
2006
IEEE
15 years 9 months ago
2006
IEEE
— Resilient Routing Layers (RRL) and Multiple Routing Configurations (MRC) have been proposed as methods to achieve fast recovery from router and link failures in connectionless...
110
Voted
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...