Sciweavers

868 search results - page 69 / 174
» A general compression algorithm that supports fast searching
Sort
View
TABLEAUX
2009
Springer
14 years 1 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 27 days ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
CIKM
2009
Springer
14 years 1 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
14 years 2 months ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
14 years 9 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu