Sciweavers

11231 search results - page 2062 / 2247
» Digging for Data Structures
Sort
View
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
15 years 28 days ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
COGSR
2011
109views more  COGSR 2011»
14 years 10 months ago
How groups develop a specialized domain vocabulary: A cognitive multi-agent model
We simulate the evolution of a domain vocabulary in small communities. Empirical data show that human communicators can evolve graphical languages quickly in a constrained task (P...
David Reitter, Christian Lebiere
COLING
2010
14 years 10 months ago
DL Meet FL: A Bidirectional Mapping between Ontologies and Linguistic Knowledge
We present a transformation scheme that mediates between description logics (DL) or RDF-encoded ontologies and type hierarchies in feature logics (FL). The DL-to-FL direction is i...
Hans-Ulrich Krieger, Ulrich Schäfer
ENTCS
2011
99views more  ENTCS 2011»
14 years 10 months ago
Symmetry and Composition in Probabilistic Theories
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
Alexander Wilce
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
14 years 10 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto
« Prev « First page 2062 / 2247 Last » Next »