Sciweavers

2654 search results - page 308 / 531
» On Pairing Inversion Problems
Sort
View
COMPGEOM
2006
ACM
16 years 18 days ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
ESOP
2001
Springer
15 years 11 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
163
Voted
ICCAD
1998
IEEE
65views Hardware» more  ICCAD 1998»
15 years 11 months ago
Multiway partitioning with pairwise movement
It is known to many researchers in the partitioning community that the recursive bipartitioning approach outperforms the direct non-recursive approach in solving the multiway part...
Jason Cong, Sung Kyu Lim
FGR
2006
IEEE
121views Biometrics» more  FGR 2006»
15 years 10 months ago
Optimal Hand Gesture Vocabulary Design Using Psycho-Physiological and Technical Factors
A global approach to hand gesture vocabulary design is proposed which includes human as well as technical design factors. The human centered desires of multiple users are implicit...
Helman Stern, Juan P. Wachs, Yael Edan
FOCS
1995
IEEE
15 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos