356 search results - page 38 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
IJCGA
2007
15 years 10 days ago
2007
: We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, wh...
95
Voted
CORR
2002
Springer
15 years 7 days ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
119
Voted
JUCS
2002
15 years 2 days ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
107
click to vote
DAC
1994
ACM
15 years 4 months ago
1994
ACM
Today's high-performance single-chip CMOS microprocessors are the most complex and challenging chip designs ever implemented. To stay on the leading edge, Digital's micro...
100
Voted
IACR
2011
14 years 2 days ago
2011
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...