Sciweavers

1521 search results - page 256 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
JELIA
1998
Springer
15 years 6 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
MICRO
1997
IEEE
82views Hardware» more  MICRO 1997»
15 years 6 months ago
Procedure Based Program Compression
Cost and power consumption are two of the most important design factors for many embedded systems, particularly consumer devices. Products such as Personal Digital Assistants, pag...
Darko Kirovski, Johnson Kin, William H. Mangione-S...
SP
1997
IEEE
135views Security Privacy» more  SP 1997»
15 years 6 months ago
Analysis of a Denial of Service Attack on TCP
This paper analyzes a network-baseddenial of service attack for IP (Internet Protocol) based networks. It is popularly called SYN flooding. It works by an attacker sending many T...
Christoph L. Schuba, Ivan Krsul, Markus G. Kuhn, E...
113
Voted
SSD
1993
Springer
112views Database» more  SSD 1993»
15 years 6 months ago
A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
Thomas Brinkhoff, Holger Horn, Hans-Peter Kriegel,...
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 6 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos