Sciweavers

604 search results - page 25 / 121
» The Hardness of Metric Labeling
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
CIKM
2004
Springer
14 years 1 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
EMMCVPR
2005
Springer
14 years 1 months ago
Linear Programming Matching and Appearance-Adaptive Object Tracking
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
Hao Jiang, Mark S. Drew, Ze-Nian Li
WSDM
2012
ACM
207views Data Mining» more  WSDM 2012»
12 years 3 months ago
Sequence clustering and labeling for unsupervised query intent discovery
One popular form of semantic search observed in several modern search engines is to recognize query patterns that trigger instant answers or domain-specific search, producing sem...
Jackie Chi Kit Cheung, Xiao Li
OTM
2007
Springer
14 years 2 months ago
Understanding the Occurrence of Errors in Process Models Based on Metrics
Abstract. Business process models play an important role for the management, design, and improvement of process organizations and processaware information systems. Despite the exte...
Jan Mendling, Gustaf Neumann, Wil M. P. van der Aa...