1487 search results - page 62 / 298 » The Computational Complexity of Link Building |
112
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
111
click to vote
JSAC
2006
15 years 1 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
143
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
129
click to vote
IWANN
2005
Springer
15 years 7 months ago
2005
Springer
Carbon nanotubes are often seen as the only alternative technology to silicon transistors. While they are the most likely short-term alternative, other longer-term alternatives sho...
100
click to vote
PERCOM
2009
ACM
15 years 8 months ago
2009
ACM
In this paper we describe our approach to realize a pervasive (computing) learning environment for children based on augmented toys: traditional toys that are equipped with pervas...