19866 search results - page 270 / 3974 » Computing all factorizations in *** |
186
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
166
click to vote
AUTOMOTIVEUI
2009
ACM
16 years 1 months ago
2009
ACM
The increasing use of touchscreen interfaces in vehicles poses challenges to designers in terms of optimizing safety, usability and affective response. It is thought that the appl...
151
click to vote
EICS
2009
ACM
16 years 1 months ago
2009
ACM
We evaluated and compared four input methods using the Nintendo Wii Remote for pointing tasks. The methods used (i) the "A" button on top of the device, (ii) the "B...
223
click to vote
SMA
2009
ACM
16 years 1 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
150
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...