28888 search results - page 5561 / 5778 » Computability and complexity in analysis |
132
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
116
Voted
OOPSLA
2009
Springer
15 years 10 months ago
2009
Springer
Software correctness has bedeviled the field of computer science since its inception. Software complexity has increased far more quickly than our ability to control it, reaching ...
127
click to vote
SSD
2009
Springer
15 years 10 months ago
2009
Springer
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
146
Voted
HT
2009
ACM
15 years 10 months ago
2009
ACM
The early Web was hailed for being easy to use, and what is more important, giving people a chance to participate in its growth. The Web3D was believed to have potential to be the...
119
Voted
IMC
2009
ACM
15 years 10 months ago
2009
ACM
Many enterprise, campus, and data-center networks have complex layer-2 virtual LANs (“VLANs”) below the IP layer. The interaction between layer-2 and IP topologies in these VL...