477 search results - page 47 / 96 » Algorithms for dynamic geometric problems over data streams |
137
click to vote
SSD
2007
Springer
15 years 4 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
SIGSOFT
2004
ACM
15 years 10 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
101
click to vote
JMM2
2008
14 years 10 months ago
2008
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
112
click to vote
APVIS
2011
2011
Loose capacity-constrained representatives for the qualitative visual analysis in molecular dynamics
13 years 10 months ago
Molecular dynamics is a widely used simulation technique to investigate material properties and structural changes under external forces. The availability of more powerful cluster...
110
click to vote
TIP
2010
14 years 8 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...