Sciweavers

361 search results - page 10 / 73
» Maximum subset intersection
Sort
View
CCCG
2007
15 years 3 months ago
Contraction and Expansion of Convex Sets
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
Michael Langberg, Leonard J. Schulman
TCOM
2008
119views more  TCOM 2008»
15 years 1 months ago
Maximum likelihood detection for differential unitary space-time modulation with carrier frequency offset
Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency offset (CFO)? This paper answers this question affirmative...
Feifei Gao, Tao Cui, Arumugam Nallanathan, Chintha...
AMC
2010
111views more  AMC 2010»
15 years 2 months ago
Algebraic C*-actions and the inverse kinematics of a general 6R manipulator
Let X be a smooth quadric of dimension 2m in P2m+1 C and let Y, Z X be subvarieties both of dimension m which intersect transversely. In this paper we give an algorithm for comput...
Sandra Di Rocco, David Eklund, Andrew J. Sommese, ...
114
Voted
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
15 years 7 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
WSCG
2003
177views more  WSCG 2003»
15 years 3 months ago
An Architecture for Hierarchical Collision Detection
We present novel algorithms for efficient hierarchical collision detection and propose a hardware architecture for a single-chip accelerator. We use a hierarchy of bounding volum...
Gabriel Zachmann, Günter Knittel