1995 search results - page 314 / 399 » What's the Problem |
141
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
144
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
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...
117
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— 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...
147
Voted
PLDI
2005
ACM
15 years 9 months ago
2005
ACM
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
125
Voted
PRICAI
2004
Springer
15 years 9 months ago
2004
Springer
When we have a large amount of information, we usually use categories with a hierarchy, in which all information is assigned. This paper proposes a new method of integrating two ca...