Sciweavers

503 search results - page 57 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
ACSC
2007
IEEE
15 years 9 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
FGCN
2008
IEEE
116views Communications» more  FGCN 2008»
15 years 10 months ago
Routing in Degree-Constrained FSO Mesh Networks
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
Ziping Hu, Pramode K. Verma, James J. Sluss Jr.
140
Voted
TON
2010
197views more  TON 2010»
15 years 1 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
129
Voted
COMPUTE
2010
ACM
15 years 7 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
112
Voted
ANLP
1992
116views more  ANLP 1992»
15 years 4 months ago
Automatic Learning for Semantic Collocation
The real di culty in development of practical NLP systems comes from the fact that we do not have e ective means for gathering \knowledge". In this paper, we propose an algor...
Satoshi Sekine, Jeremy J. Carroll, Sophia Ananiado...