Sciweavers

2735 search results - page 473 / 547
» Comparing notions of randomness
Sort
View
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 3 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 3 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
14 years 3 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
INFOCOM
2006
IEEE
14 years 3 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee
ITCC
2005
IEEE
14 years 3 months ago
A Framework for Key Management in Mobile Ad Hoc Networks
Background: Key management in a mobile ad hoc environment is complicated by frequently partitioning network topology. Recently proposed key management systems (KMSs) provide limit...
George C. Hadjichristofi, William Joseph Adams, Na...