Sciweavers

400 search results - page 61 / 80
» What Makes a Problem GP-Hard
Sort
View
145
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
122
Voted
INFOCOM
2006
IEEE
15 years 10 months ago
Self-Learning Collision Avoidance for Wireless Networks
— The limited number of orthogonal channels and the autonomous installations of hotspots and home wireless networks often leave neighboring 802.11 basic service sets (BSS’s) op...
Chun-cheng Chen, Eunsoo Seo, Hwangnam Kim, Haiyun ...
97
Voted
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 8 months ago
Fair watermarking techniques
Many intellectual property protection (IPP) techniques have been proposed. Their primary objectives are providing convincible proof of authorship with least degradation of the qua...
Gang Qu, Jennifer L. Wong, Miodrag Potkonjak
COMPGEOM
2005
ACM
15 years 6 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
RR
2010
Springer
15 years 2 months ago
Query-Based Access Control for Ontologies
Role-based access control is a standard mechanism in information systems. Based on the role a user has, certain information is kept from the user even if requested. For ontologies ...
Martin Knechtel, Heiner Stuckenschmidt