Sciweavers

2413 search results - page 227 / 483
» Understanding the problem
Sort
View
CORR
2012
Springer
176views Education» more  CORR 2012»
14 years 7 hour ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
W4A
2005
ACM
15 years 9 months ago
What's the web like if you can't see it?
Awareness of Web accessibility is spreading all over the world among Web designers and developers, due to regulations such as the US law called Section 508 and guidelines like the...
Chieko Asakawa
ACL
2008
15 years 5 months ago
Extraction of Entailed Semantic Relations Through Syntax-Based Comma Resolution
This paper studies textual inference by investigating comma structures, which are highly frequent elements whose major role in the extraction of semantic relations has not been hi...
Vivek Srikumar, Roi Reichart, Mark Sammons, Ari Ra...
CISS
2008
IEEE
15 years 10 months ago
A linear integer programming approach to analyze P2P media streaming
Recent advancement in peer-to-peer (P2P) technologies has enabled a wide range of new applications. In this paper, we present mixed integer programming (MIP) formulations to analy...
Fulu Li, Jianwei Huang, Andrew Lippman
ICALP
2007
Springer
15 years 10 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...