Sciweavers

200 search results - page 35 / 40
» What Graphs can be Efficiently Represented by BDDs
Sort
View
BMCBI
2007
142views more  BMCBI 2007»
13 years 7 months ago
LinkHub: a Semantic Web system that facilitates cross-database queries and information retrieval in proteomics
nd: A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among...
Andrew K. Smith, Kei-Hoi Cheung, Kevin Y. Yip, Mar...
WEBI
2007
Springer
14 years 1 months ago
Blog Community Discovery and Evolution Based on Mutual Awareness Expansion
There are information needs involving costly decisions that cannot be efficiently satisfied through conventional web search engines. Alternately, community centric search can prov...
Yu-Ru Lin, Hari Sundaram, Yun Chi, Jun'ichi Tatemu...
VL
2005
IEEE
14 years 1 months ago
Transformation of UML State Machines for Direct Execution
Executable UML models are nowadays gaining interest in embedded systems design. This domain is strongly devoted to the modeling of reactive behavior using StateChart variants. In ...
Tim Schattkowsky, Wolfgang Müller 0003
WWW
2009
ACM
14 years 8 months ago
idMesh: graph-based disambiguation of linked data
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
Hermann de Meer, Karl Aberer, Michael Jost, Parisa...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...