774 search results - page 95 / 155 » A subdivision-based algorithm for the sparse resultant |
COLT
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
100
click to vote
DIAGRAMS
2006
Springer
15 years 5 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
ECIR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We applied different clustering algorithms to the task of clustering multi-word terms in order to reflect a humanly built ontology. Clustering was done without the usual ...
130
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
120
click to vote
ASPLOS
2010
ACM
15 years 13 days ago
2010
ACM
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...