Sciweavers

568 search results - page 57 / 114
» A query language for analyzing networks
Sort
View
ACTA
2010
104views more  ACTA 2010»
13 years 8 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
ESANN
2006
13 years 10 months ago
Margin based Active Learning for LVQ Networks
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples during the model adaptation...
Frank-Michael Schleif, Barbara Hammer, Thomas Vill...
DEBU
2010
180views more  DEBU 2010»
13 years 8 months ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...
WWW
2006
ACM
14 years 9 months ago
A web-based kernel function for measuring the similarity of short text snippets
Determining the similarity of short text snippets, such as search queries, works poorly with traditional document similarity measures (e.g., cosine), since there are often few, if...
Mehran Sahami, Timothy D. Heilman
ECIR
2007
Springer
13 years 10 months ago
Similarity Measures for Short Segments of Text
Measuring the similarity between documents and queries has been extensively studied in information retrieval. However, there are a growing number of tasks that require computing th...
Donald Metzler, Susan T. Dumais, Christopher Meek