Sciweavers

970 search results - page 124 / 194
» On encodings of spanning trees
Sort
View
COLING
2002
13 years 10 months ago
Location Normalization for Information Extraction
Ambiguity is very high for location names. For example, there are 23 cities named `Buffalo' in the U.S. Country names such as `Canada', `Brazil' and `China' ar...
Huifeng Li, Rohini K. Srihari, Cheng Niu, Wei Li 0...
JACM
2010
135views more  JACM 2010»
13 years 8 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
PVLDB
2010
200views more  PVLDB 2010»
13 years 8 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
SIAMDM
2010
117views more  SIAMDM 2010»
13 years 8 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
EMNLP
2010
13 years 8 months ago
Dual Decomposition for Parsing with Non-Projective Head Automata
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...