Sciweavers

1801 search results - page 55 / 361
» Pointing without a pointer
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 1 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
AOR
2006
95views more  AOR 2006»
13 years 9 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
OOPSLA
2007
Springer
14 years 3 months ago
Using early phase termination to eliminate load imbalances at barrier synchronization points
We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates ea...
Martin C. Rinard