Sciweavers

618 search results - page 115 / 124
» Short cycle connectivity
Sort
View
138
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
118
Voted
COMPSAC
2011
IEEE
14 years 15 days ago
Palimpsests of Time and Place
— This paper discusses ongoing research into the development of an original composition portfolio themed on the concept of palimpsests of time and place. The research involves th...
Jerry Fishenden, Andrew Hugill
145
Voted
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 3 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
82
Voted
WWW
2009
ACM
16 years 1 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts
121
Voted
WWW
2007
ACM
16 years 1 months ago
Web4CE: accessing web-based applications on consumer devices
In a world where all devices will be interconnected, the boundaries between the different devices will start to disappear. Devices will be able to access each other's applica...
Walter Dees, Paul Shrubsole