Sciweavers

1486 search results - page 146 / 298
» Algorithms for two-box covering
Sort
View
AIRS
2004
Springer
16 years 8 days ago
Document Clustering Using Linear Partitioning Hyperplanes and Reallocation
This paper presents a novel algorithm for document clustering based on a combinatorial framework of the Principal Direction Divisive Partitioning (PDDP) algorithm [1] and a simpli...
Canasai Kruengkrai, Virach Sornlertlamvanich, Hito...
GLOBECOM
2007
IEEE
16 years 1 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
SDM
2009
SIAM
108views Data Mining» more  SDM 2009»
16 years 4 months ago
Highlighting Diverse Concepts in Documents.
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the differ...
Evimaria Terzi, Kun Liu, Tyrone Grandison
ICRA
2007
IEEE
129views Robotics» more  ICRA 2007»
16 years 1 months ago
Multi-Robot Area Patrol under Frequency Constraints
— This paper discusses the problem of generating patrol paths for a team of mobile robots inside a designated target area. Patrolling requires an area to be visited repeatedly by...
Yehuda Elmaliach, Noa Agmon, Gal A. Kaminka