Sciweavers

668 search results - page 46 / 134
» Algorithmics and Applications of Tree and Graph Searching
Sort
View
PVLDB
2010
128views more  PVLDB 2010»
14 years 8 months ago
Searching Workflows with Hierarchical Views
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
Ziyang Liu, Qihong Shao, Yi Chen
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 6 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
AAAI
2007
15 years 4 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
AINA
2010
IEEE
15 years 6 months ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
ICML
2004
IEEE
16 years 2 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...