Sciweavers

9572 search results - page 281 / 1915
» Cover Algorithms and Their Combination
Sort
View
AIRS
2004
Springer
16 years 11 min 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...
VLDB
1998
ACM
110views Database» more  VLDB 1998»
15 years 10 months ago
Massive Stochastic Testing of SQL
Deterministic testing of SQL database systems is human intensive and cannot adequately cover the SQL input domain. A system (RAGS), was built to stochastically generate valid SQL ...
Donald R. Slutz
CCR
2004
86views more  CCR 2004»
15 years 6 months ago
IPv4 address allocation and the BGP routing table evolution
The IP address consumption and the global routing table size are two of the vital parameters of the Internet growth. In this paper we quantitatively characterize the IPv4 address ...
Xiaoqiao Meng, Zhiguo Xu, Beichuan Zhang, Geoff Hu...
GLOBECOM
2007
IEEE
16 years 28 days 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