Sciweavers

2907 search results - page 336 / 582
» Presentations of Structures in Admissible Sets
Sort
View
COLING
1996
15 years 8 months ago
Analysis of Japanese Compound Nouns by Direct Text Scanning
This paper aims to analyze word dependency structure in compound nouns appearing in Japanese newspaper articles. The analysis is a dil't:icult problem because such compound n...
Toru Hisamitsu, Yoshihiko Nitta
COMAD
2009
15 years 7 months ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran
178
Voted
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
15 years 7 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
APAL
2010
98views more  APAL 2010»
15 years 6 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes
CGF
2008
217views more  CGF 2008»
15 years 6 months ago
A Flexible Kernel for Adaptive Mesh Refinement on GPU
We present a flexible GPU kernel for adaptive on-the-fly refinement of meshes with arbitrary topology. By simply reserving a small amount of GPU memory to store a set of adaptive ...
Tamy Boubekeur, Christophe Schlick