Sciweavers

828 search results - page 92 / 166
» Simplicial Powers of Graphs
Sort
View
EMNLP
2006
13 years 9 months ago
Learning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
Michael L. Wick, Aron Culotta, Andrew McCallum
JGAA
2006
72views more  JGAA 2006»
13 years 7 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt
TCOM
2008
120views more  TCOM 2008»
13 years 7 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
NJC
2000
99views more  NJC 2000»
13 years 7 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
NETWORKING
2011
12 years 10 months ago
STEPS - An Approach for Human Mobility Modeling
Abstract. In this paper we introduce Spatio-TEmporal Parametric Stepping (STEPS) - a simple parametric mobility model which can cover a ectrum of human mobility patterns. STEPS mak...
Anh Dung Nguyen, Patrick Sénac, Victor Rami...