Sciweavers

14386 search results - page 2453 / 2878
» Algorithms for user interfaces
Sort
View
DAWAK
2008
Springer
15 years 9 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
ESOP
2008
Springer
15 years 9 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
235
Voted
AAAI
2010
15 years 9 months ago
How Incomplete Is Your Semantic Web Reasoner?
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up com...
Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrock...
245
Voted
AAAI
2010
15 years 9 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
CASCON
2007
63views Education» more  CASCON 2007»
15 years 9 months ago
A search-based approach for dynamically re-packaging downloadable applications
Mechanisms such as Java Web Start enable on-thefly downloading and execution of applications installed on remote servers, without the need for having them installed on the local ...
Thierry Bodhuin, Massimiliano Di Penta, Luigi Troi...
« Prev « First page 2453 / 2878 Last » Next »