Sciweavers

11211 search results - page 2000 / 2243
» Rank-Sensitive Data Structures
Sort
View
SARA
2009
Springer
15 years 8 months ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
ADBIS
2001
Springer
108views Database» more  ADBIS 2001»
15 years 8 months ago
An RMM-Based Methodology for Hypermedia Presentation Design
Due to the rapid growth of the Web, there is an increasing need for methodologies that support the design of Web-based Information Systems (WIS). After investigating the applicatio...
Flavius Frasincar, Geert-Jan Houben, Richard Vdovj...
CHARME
2001
Springer
98views Hardware» more  CHARME 2001»
15 years 8 months ago
Hardware Synthesis Using SAFL and Application to Processor Design
Abstract. We survey the work done so far in the FLaSH project (Functional Languages for Synthesising Hardware) in which the core ideas are (i) using a functional language SAFL to d...
Alan Mycroft, Richard Sharp
CIKM
2001
Springer
15 years 8 months ago
Reorganizing Web Sites Based on User Access Patterns
In this paper, an approach for reorganizing Web sites based on user access patterns is proposed. Our goal is to build adaptive Web sites by evolving site structure to facilitate u...
Yongjian Fu, Mario Creado, Chunhua Ju
COCOON
2001
Springer
15 years 8 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
« Prev « First page 2000 / 2243 Last » Next »