2168 search results - page 247 / 434 » Randomized Algorithms and Complexity Theory |
132
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account ...
132
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
162
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
120
Voted
CSUR
2004
15 years 3 months ago
2004
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
140
Voted
EUROSYS
2007
ACM
15 years 7 months ago
2007
ACM
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...