494 search results - page 91 / 99 » Heap Building Bounds |
74
Voted
SMA
2003
ACM
15 years 3 months ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
102
click to vote
AMKM
2003
Springer
15 years 3 months ago
2003
Springer
We first describe a multi-agent system managing a corporate memory in the form of a corporate semantic web. We then focus on a newly introduced society of agents in charge of wrap...
75
Voted
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
EWSN
2010
Springer
15 years 3 months ago
2010
Springer
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...
105
click to vote
HICSS
2002
IEEE
15 years 3 months ago
2002
IEEE
This paper is to study the information system development (ISD) by looking into fifty-six cases from the perspectives of power development stage and organizational politics. We in...