932 search results - page 143 / 187 » Where in the Wikipedia Is That Answer |
GG
2010
Springer
13 years 5 months ago
2010
Springer
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
FAST
2009
13 years 5 months ago
2009
Some tasks in a dataspace (a loose collection of heterogeneous data sources) require integration of fine-grained data from diverse sources. This work is often done by end users kn...
ICWS
2009
IEEE
13 years 5 months ago
2009
IEEE
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider generic curves in R2 , i.e. generic C1 functions f : S1 R2 . We analyze these curves through the persistent homology groups of a filtration induced on S1 by f. In parti...