Sciweavers

611 search results - page 29 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
IPM
2007
101views more  IPM 2007»
13 years 7 months ago
Decisions in thesaurus construction and use
A thesaurus and an ontology provide a set of structured terms, phrases, and metadata, often in a hierarchical arrangement, that may be used to index, search, and mine documents. W...
Robert M. Losee
PVLDB
2010
200views more  PVLDB 2010»
13 years 6 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
LICS
2008
IEEE
14 years 2 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
CIKM
1997
Springer
14 years 2 days ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
ICIP
2003
IEEE
14 years 9 months ago
Kernel indexing for relevance feedback image retrieval
Relevance feedback is an attractive approach to developing flexible metrics for content-based retrieval in image and video databases. Large image databases require an index struct...
Jing Peng, Douglas R. Heisterkamp