Sciweavers

2365 search results - page 10 / 473
» All things are connected
Sort
View
NAACL
2010
14 years 9 months ago
Not All Seeds Are Equal: Measuring the Quality of Text Mining Seeds
Open-class semantic lexicon induction is of great interest for current knowledge harvesting algorithms. We propose a general framework that uses patterns in bootstrapping fashion ...
Zornitsa Kozareva, Eduard H. Hovy
IJWMC
2007
84views more  IJWMC 2007»
14 years 11 months ago
Towards all-IP wireless networks: architectures and resource management mechanism
Future wireless Internet will consist of different wireless technologies that should operate together in an efficient way to provide seamless connectivity to mobile users. The in...
Majid Ghaderi, Raouf Boutaba
INFOCOM
2008
IEEE
15 years 5 months ago
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwa...
COMBINATORICS
2004
82views more  COMBINATORICS 2004»
14 years 11 months ago
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
R. Bruce Richter
CCCG
2004
15 years 21 days ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...