5022 search results - page 619 / 1005 » Data structures and problem solving using Java |
175
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
133
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
128
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Predicting a protein’s structural class from its amino acid sequence is a fundamental problem in computational biology. Much recent work has focused on developing ne...
120
click to vote
ICSM
2008
IEEE
15 years 10 months ago
2008
IEEE
More than 90% of the cost of software is due to maintenance and evolution. Understanding the evolution of large software systems is a complex problem, which requires the use of va...
141
Voted
SYSTOR
2009
ACM
15 years 10 months ago
2009
ACM
A typical storage hierarchy comprises of components with varying performance and cost characteristics, providing multiple options for data placement. We propose and evaluate a hie...