15494 search results - page 357 / 3099 » Computing dynamic clusters |
225
Voted
BMCBI
2005
15 years 6 months ago
2005
The MCBIOS 2004 conference brought together regional researchers and students in biology, computer science and bioinformatics on October 7th-9th 2004 to present their latest work....
187
click to vote
APWEB
2005
Springer
16 years 9 days ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
198
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
140
click to vote
PDCAT
2007
Springer
16 years 26 days ago
2007
Springer
The mobile Internet enables 24-hour always-on computing with increased demands on time-based analysis. From an assumption that the mobile users are split into three different clus...
185
click to vote
IWPC
1997
IEEE
15 years 10 months ago
1997
IEEE
A dynamic program slice is an executable part of a program whose behavior is identical, for the same program input, to that of an original program with respect to a variable(s) of...